Conference paper
Active Data Mining
Rakesh Agrawal, Giuseppe Psaila
KDD 1995
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.
Rakesh Agrawal, Giuseppe Psaila
KDD 1995
Krishna Kummamuru, Raghu Krishnapuram, et al.
ICDM 2005
Rakesh Agrawal, Edward L. Wimmers
SIGMOD 2000
Rakesh Agrawal, Ramakrishnan Srikant, et al.
SIGMOD 2005