41 search results - page 2 / 9 » Parallel and Distributed Frequent Itemset Mining on Dynamic ... |
PODS
2003
ACM
14 years 5 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
SBACPAD
2003
IEEE
13 years 11 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
VLDB
2007
ACM
13 years 12 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 6 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...
DAWAK
2010
Springer
13 years 6 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...