1;3409;0c Mining Association Rules between Sets of Items in Large Databases

Mining Association Rules between Sets of Items in Large Databases

993 ACM SIGMOD International Conference on Management of Data, 1993
Pages: 207-216DOI: 10.1145/170035.170072

SIGMOD

bibtex

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.