Sciweavers

121 search results - page 21 / 25
» Mining association rules in very large clustered domains
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 7 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
SDM
2009
SIAM
192views Data Mining» more  SDM 2009»
14 years 4 months ago
Mining Cohesive Patterns from Graphs with Feature Vectors.
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
Arash Rafiey, Flavia Moser, Martin Ester, Recep Co...
DEBU
2008
186views more  DEBU 2008»
13 years 7 months ago
A Survey of Collaborative Recommendation and the Robustness of Model-Based Algorithms
The open nature of collaborative recommender systems allows attackers who inject biased profile data to have a significant impact on the recommendations produced. Standard memory-...
Jeff J. Sandvig, Bamshad Mobasher, Robin D. Burke
KDD
2005
ACM
161views Data Mining» more  KDD 2005»
14 years 7 months ago
Combining email models for false positive reduction
Machine learning and data mining can be effectively used to model, classify and discover interesting information for a wide variety of data including email. The Email Mining Toolk...
Shlomo Hershkop, Salvatore J. Stolfo
ISPASS
2009
IEEE
14 years 2 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...