An Efficient Algorithm for Discovering Maximum Length Frequent Itemsets.
Tran Anh TaiNgo Tuan PhongNguyen Kim AnhPublished in: KSE (2011)
Keyphrases
- frequent itemsets
- preprocessing
- frequent itemset mining
- pruning strategy
- memory efficient
- algorithms for mining association rules
- frequent closed
- data mining
- apriori algorithm
- k means
- itemsets
- pattern growth
- frequent closed itemsets
- single scan
- dense datasets
- discovery of association rules
- frequent itemset discovery
- mining frequent closed itemsets
- data structure