ABSTRACT
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel estimation and pruning techniques. We also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm.
- 1.Rakesh Agrawal, Tomasz Imielinski, and Arun Swami, "Database Mining: A Performance Perspective", IEEE Transactions on Knowledge and Data Engineering, Special Issue on Learning and Discovery in Knowledge-Based Databases, (to appear). Google ScholarDigital Library
- 2.Rakesh Agrawal, Sakti Ghosh, Tomasz Imielinski, Bala Iyer, and Arun Swami, "An Interval Classifier for Database Mining Applications", VLDB-92, Vancouver, British Columbia, 1992, 560-573. Google ScholarDigital Library
- 3.Dina Bitton, "Bridging the Gap Between Database Theory and Practice", Cadre Technologies, Menlo Park, 1992.Google Scholar
- 4.L. Breiman, j. H. Friedman, R. A. Olshen, and C. J. Stone, Classification and Regression Trees, Wadsworth, Belmont, 1984.Google Scholar
- 5.B. Falkenhainer and R. Michalski, "Integrating Quantitative and Qualitative Discovery: The ABACUS System", Machine Learning, 1(4): 367- 401. Google ScholarDigital Library
- 6.M. Kokar, "Discovering Functional Formulas through Changing Representation Base", Proceedings of the Fifth National Conference on Artificial Intelligence, 1986, 455-459.Google Scholar
- 7.P. Langley, H. Simon, G. Bradshaw, and J. Zytkow, Scientific Discovery: Compulalional Explorations of the Creative Process, The MIT Press, Cambridge, Mass., 1987. Google ScholarDigital Library
- 8.Heikki Mannila and Kari-Jouku Raiha, "Dependency Inference", VLDB-87, Brighton, England, 1987, 155-158. Google ScholarDigital Library
- 9.J. Ross Quinlan, "induction of Decision Trees", Machine Learning, 1, 1986, 81-106. Google ScholarDigital Library
- 10.G. Piatetsky-Shapiro, Discovery, Analysis, and Presentation of Strong Rules, In {11}, 229-248.Google Scholar
- 11.G. Piatetsky-Shapiro (Editor), Knowledge Discovery in Databases, AAAI/MIT Press, 1991. Google ScholarDigital Library
- 12.L.G. Valiant, "A Theory of Learnable", CA CM, 27, 1134-1142, 1984. Google ScholarDigital Library
- 13.L.G. Valiant, "Learning Disjunctions and Conjunctions", IJCAI-85, Los Angeles, 1985, 560-565.Google Scholar
- 14.Yi-Hua Wu and Shulin Wang, Discovering Functional Relationships from Observational Data, In {11}, 55-70.Google Scholar
Index Terms
Mining association rules between sets of items in large databases
Recommendations
Mining Multiple-Level Association Rules in Large Databases
A top-down progressive deepening method is developed for efficient mining of multiple-level association rules from large transaction databases based on the Apriori principle. A group of variant algorithms is proposed based on the ways of sharing ...
An efficient graph-based approach to mining association rules for large databases
The task of data mining is to find the useful information within the incredible sets of data. One of important research areas of data mining is mining association rules. If we can find these relations by mining association rules, we can provide better ...
Comments