Abstract
The standard model for association-rule mining involves a set of “items” and a set of “baskets.” The baskets contain items that some customer has purchased at the same time. The problem is to find pairs, or perhaps larger sets, of items that frequently appear together in baskets. We mention the principal approaches to efficient, large-scale discovery of the frequent itemsets, including the a-priori algorithm, improvements using hashing, and one- and two-pass probabilistic algorithms for finding frequent itemsets. We then turn to techniques for finding highly corre- lated, but infrequent, pairs of items. These notes were written for CS345 at Stanford University and are reprinted by permission of the author. http://www-db.stanford.edu/~ullman/mining/mining.html gives you access to the entire set of notes, including additional citations and on-line links.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, T. Imielinski, and A. Swami, “Mining Associations between Sets of Items in Massive Databases,” Proc. of the ACM SIGMOD Int’l. Conference on Management of Data, May 1993, pp. 207–216.
R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. 20th Int’l. Conference on Very Large Databases, Sept. 1994.
E. Cohen et al., “Finding Interesting Associations without Support Pruning,” Proc. Int’l. Conference on Data Engineering, 2000.
M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. Ullman, “Computing Iceberg Queries Efficiently,” Proc. 20th Int’l. Conference on Very Large Databases, 1998.
J. S. Park, M.-S. Chen, and P. S. Yu, “An Effective Hash-Based Algorithm for Mining Association Rules,” Proc. of the ACM SIGMOD Int’l. Conference on Management of Data, 1995, pp. 175–186.
A. Savesere, E. Omiecinski, and S. Navathe, “An efficient algorithm for mining association rules in large databases,” Proc. 20th Int’l. Conference on Very Large Databases, 1995, pp. 432–444.
H. Toivonen, “Sampling Large Databases for Association Rules,” Proc. 20th Int’l. Conference on Very Large Databases, 1996, pp. 134–145.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ullman, J.D. (2000). A Survey of Association-Rule Mining. In: Arikawa, S., Morishita, S. (eds) Discovery Science. DS 2000. Lecture Notes in Computer Science(), vol 1967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44418-1_1
Download citation
DOI: https://doi.org/10.1007/3-540-44418-1_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41352-3
Online ISBN: 978-3-540-44418-3
eBook Packages: Springer Book Archive