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 association rules between sets of items in large databases
SIGMOD '93: Proceedings of the 1993 ACM SIGMOD international conference on Management of dataWe 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 ...
Mining Utility Association Rules
ICCAE 2018: Proceedings of the 2018 10th International Conference on Computer and Automation EngineeringMining high utility itemset is to find the itemsets that can bring higher profits to the company, which considers both of the profits and purchased quantities for the items. However, from the high utility itemsets, we cannot know what products should be ...
Mining high utility quantitative association rules
DaWaK'07: Proceedings of the 9th international conference on Data Warehousing and Knowledge DiscoveryMining weighted association rules considers the profits of items in a transaction database, such that the association rules about important items can be discovered. However, high profit items may not always be high revenue products, since purchased ...
Comments