Fast algorithms for mining association rules
Rakesh Agrawal, Ramakrishnan Srikant · 1998
We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems. We also show how the best features of the two proposed algorithms can be combined into a hybrid algorithm, called AprioriHybrid. Scale-up experiments show that AprioriHybrid scales linearly with the number of transactions. AprioriHybrid also has excellent scale-up properties with respect to the transaction size and the number of items in the database. 1 Introduction Progress in bar-code technology has made it possible for retail organizations to collect and store massive amounts of sales data, referred to as the basket data. A record in such data typically consists of the tran...
Cited by 10,631 works.
Authors
References
- Classification and Regression Trees.
- Classification and Regression Trees.
- C4.5: Programs for Machine Learning
- Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
- Mining association rules between sets of items in large databases
- Fast Algorithms for Mining Association Rules in Large Databases
- Database mining: a performance perspective
- Knowledge Acquisition Via Incremental Conceptual Clustering
- Discovery, Analysis, and Presentation of Strong Rules
- A Bayesian Method for the Induction of Probabilistic Networks from Data