ACM SIGMOD ONLINE
ACM SIGMOD Online
ACM
Search SIGMOD Join SIGMOD Feedback What's New Home
Home
About SIGMOD
SIGMOD/PODS Conferences
SIGMOD Record
DBLP Bibliography
SIGMOD Digital Symposium Collection
SIGMOD Anthology
SIGMOD Digital Review
Industry Pages
The PODS Pages
Post/Read DB World Messages
Literature
Resources
Calendar
SIGMOD Awards

2003 SIGMOD Test of Time Award
Mining Association Rules Between Sets of Items in Large Databases
Rakesh Agrawal, Tomasz Imielinski, and Arun Swami

This paper started a field of research. In addition to containing an innovative algorithm, its subject matter brought data mining to the attention of the database community, as well as impressing on other communities interested in data mining the importance of looking at issues of scale. The paper is ancestral not only to an unusually large tree of other works, but even led several years ago to an IBM commercial, featuring supermodels, that touted the importance of work such as that contained in this paper.

Back

© 2000 Association for Computing Machinery
Acknowledgements