A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets.
Luigi TroianoGiacomo ScibelliPublished in: Data Min. Knowl. Discov. (2014)
Keyphrases
- itemsets
- pruning strategy
- frequent itemset mining
- apriori algorithm
- mining of frequent itemsets
- tree structure
- search space
- mining high utility itemsets
- frequent item sets
- np hard
- data structure
- concept lattice
- memory efficient
- frequent closed itemsets
- sequential pattern mining algorithm
- high efficiency
- mining algorithm
- algorithms for mining association rules