Shaul Dar, Rakesh Agrawal
IEEE Transactions on Knowledge and Data Engineering
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.
Shaul Dar, Rakesh Agrawal
IEEE Transactions on Knowledge and Data Engineering
Arun Swami, K.Bernhard. Schiefer
SIGMOD Record
Roberto J. Bayardo Jr., Rakesh Agrawal, et al.
WWW 2002
Rakesh Agrawal, Linda G. Demichiel, et al.
ACM SIGPLAN Notices