214 search results - page 29 / 43 » New Parallel Algorithms for Frequent Itemset Mining in Very ... |
INFOSCALE
2007
ACM
13 years 8 months ago
2007
ACM
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
KDD
2009
ACM
13 years 11 months ago
2009
ACM
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
KDD
2012
ACM
11 years 9 months ago
2012
ACM
Outlier mining in d-dimensional point sets is a fundamental and well studied data mining task due to its variety of applications. Most such applications arise in high-dimensional ...
ICDM
2002
IEEE
13 years 11 months ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...