Parallel Mining of Top-K Frequent Itemsets in Very Large Text Database.
Yongheng WangYan JiaShuqiang YangPublished in: WAIM (2005)
Keyphrases
- frequent itemsets
- transactional databases
- itemsets
- database
- transaction databases
- discovery of association rules
- frequent closed itemsets
- mining algorithm
- frequent itemset mining
- discovering association rules
- mining frequent itemsets
- fp tree
- association rules
- association rule mining
- condensed representations
- frequent patterns
- fp growth
- data streams
- high utility
- closed frequent itemsets
- candidate itemsets
- algorithm for mining association rules
- itemset mining
- mining frequent patterns
- mining association rules
- closed itemsets
- data structure
- minimum support
- frequent itemsets mining
- pattern mining
- emerging patterns
- uncertain data
- interesting patterns
- apriori algorithm
- transaction data
- high utility itemsets
- data mining
- concise representation
- constraint based mining
- sequential patterns
- single scan
- database systems
- transactional data
- previously discovered
- mining of frequent itemsets
- mining frequent closed itemsets
- pattern growth
- text mining
- sliding window
- pruning strategy
- frequent pattern mining
- data sets
- real world
- generalized association rules
- dense datasets
- candidate generation
- anti monotone
- frequent item sets
- association rules mining
- interesting itemsets
- knowledge discovery
- frequent set mining
- maximal frequent itemsets
- inductive databases