237 search results - page 10 / 48 » Mining Frequent Itemsets Using Re-Usable Data Structure |
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine....
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
IDA
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
FIMI
2003
13 years 9 months ago
2003
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...