Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · Proceedings - ACM-SIGMOD International Conference on Management of Data · 2000
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns.
Cited by 3,216 works. doi:10.1145/342009.335372 Open-access PDF
Authors
References
- An effective hash-based algorithm for mining association rules
- Efficiently mining long patterns from databases
- Discovery of Frequent Episodes in Event Sequences
- Finding interesting rules from large sets of discovered association rules
- Beyond market baskets
- Exploratory mining and pruning optimizations of constrained associations rules
- Efficient mining of emerging patterns
- A Tree Projection Algorithm for Generation of Frequent Item Sets
- Integrating association rule mining with relational database systems
- Efficient mining of constrained correlated sets