Efficiently mining long patterns from databases
Roberto J. Bayardo · Proceedings - ACM-SIGMOD International Conference on Management of Data · 1998
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database irrespective of the length of the longest pattern. In comparison, previous algorithms based on Apriori scale exponentially with longest pattern length. Experiments on real data show that when the patterns are long, our algorithm is more efficient by an order of magnitude or more.
Cited by 1,302 works. doi:10.1145/276304.276313
Authors
References
- Mining association rules between sets of items in large databases
- Fast algorithms for mining association rules
- Mining sequential patterns
- Fast discovery of association rules
- An effective hash-based algorithm for mining association rules
- An Efficient Algorithm for Mining Association Rules in Large Databases
- Mining sequential patterns: Generalizations and performance improvements
- Dynamic itemset counting and implication rules for market basket data
- New algorithms for fast discovery of association rules
- Mining association rules with item constraints