Abstract
We describe an implementation of the well-known apriori algorithm for the induction of association rules [Agrawal et al. (1993), Agrawal et al. (1996)] that is based on the concept of a prefix tree. While the idea to use this type of data structure is not new, there are several ways to organize the nodes of such a tree, to encode the items, and to organize the transactions, which may be used in order to minimize the time needed to find the frequent itemsets as well as to reduce the amount of memory needed to store the counters. Consequently, our emphasis is less on concepts, but on implementation issues, which, however, can make a considerable difference in applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Imielienski, T., and Swami, A. (1993). Mining Association Rules between Sets of Items in Large Databases. In: Proc. Conf. on Management of Data, 207–216. New York: ACM Press
Agrawal, A., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A. (1996). Fast Discovery of Association Rules. In: Fayyad et al. (1996), 307–328
Blake, C.L. and Merz, C.J. (1998). UCI Repository of Machine Learning Databases. Dept. of Information and Computer Science, University of California at Irvine http://www.ics.uci.edu/mlearn/MLRepository.html
Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., and Uthurusamy, R., eds. (1996). Advances in Knowledge Discovery and Data Mining. Cambridge: AAAI Press/MIT Press
Han, J., Pei, J., and Yin, Y. (2000). Mining Frequent Patterns without Candidate Generation. In: Proc. Conf. on the Management of Data (SIGMOD’00, Dallas, TX). New York: ACM Press
Kohavi, R., Bradley, C.E., Frasca, B., Mason, L., and Zheng, Z. (2000). KDD-Cup 2000 Organizers’ Report: Peeling the Onion. SIGKDD Exploration 2(2):86–93.
Zheng, Z., Kohavi, R., and Mason, L. (2001). Real World Performance of Association Rule Algorithms. In: Proc. 7th Int. Conf. on Knowledge Discovery and Data Mining (SIGKDD’01). New York: ACM Press
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borgelt, C., Kruse, R. (2002). Induction of Association Rules: Apriori Implementation. In: Härdle, W., Rönz, B. (eds) Compstat. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-57489-4_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-57489-4_59
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1517-7
Online ISBN: 978-3-642-57489-4
eBook Packages: Springer Book Archive