Arun Swami, K.Bernhard. Schiefer
SIGMOD Record
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. © 1993, ACM. All rights reserved.
Arun Swami, K.Bernhard. Schiefer
SIGMOD Record
Andreas Arning, Rakesh Agrawal, et al.
KDD 1996
Rakesh Agrawal, Ameet Kini, et al.
SIGMOD 2004
Kyuseok Shim, Ramakrishnan Srikant, et al.
IEEE Transactions on Knowledge and Data Engineering