John C. Shafer, Rakesh Agrawal
Computer Networks
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.
John C. Shafer, Rakesh Agrawal
Computer Networks
Shaul Dar, Rakesh Agrawal
IEEE Transactions on Knowledge and Data Engineering
Rakesh Agrawal
PKDD 2004
Rakesh Agrawal, Johannes Gehrke, et al.
SIGMOD Record