Abstract
Association Rule mining is one of the widely used data mining techniques. To achieve a better performance, many efficient algorithms have been proposed. Despite these efforts, we are often unable to complete a mining task because these algorithms require a large amount of main memory to enumerate all frequent itemsets, especially when dataset is large or the user-specified support is low. Thus, it becomes apparent that we need to have an efficient main memory handling technique, which allows association rule mining algorithms to handle larger datasets in main memory. To achieve this goal, in this paper we propose an algorithm for vertical association rule mining that compresses a vertical dataset in an efficient manner, using bit vectors. Our performance evaluations show that the compression ratio attained by our proposed technique is better than those of the other well known techniques.
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.
References
Zaki, M.J.: Parallel and Distributed Association Mining: A Survey. IEEE Concurrency (October-December 1999)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Database. In: Proc. of the 20th VLDB, Santiago, Chile, pp. 407–419 (1994)
Agrawal, R., Imielinski, T., Swami, A.N.: Mining Association Rules Between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD, pp. 207–216 (1993)
Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering 12(2), 372–390 (2000)
Zaki, M.J., Gouda, K.: Fast Vertical Mining Using Diffsets. In: Proc. of the 9th ACM SIGKDD. ACM Press, New York (2003)
El-Hajj, M., Zaiane, O.R.: Inverted matrix efficient discovery of frequent items in large datasets in the context of interactive mining. In: Proc. of the 9th ACM SIGKDD (2003)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. of ACM SIGMOD, pp. 1–12 (2000)
Doug, B., Manuel, C., Johannes, G.: MAFIA: a maximal frequent itemset algorithm for transactional databases. In: Proc. ICDE, pp. 443–452 (2001)
Shenoy, P., Haritsa, J.R., Sudarshan, S., Bhalotia, G., Bawa, M., Shah, D.: Turbo-charging vertical mining of large databases. In: Proc. ACM SIGMOD (2000)
Geothals, B.: Memory Efficient Association Mining. In: Proc. ACM SAC (2003)
Jong, P.S., Ming-Syan, C., Philip, Y.S.: An Effective Hash Based Algorithm for Mining Association Rules. In: Proc. ACM SIGMOD, San Jose, California, pp. 175–186 (1995)
Ashoka, S., Edward, O., Shamkant, N.B.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: Proc. of the VLDB, Zurich, Swizerland, pp. 432–444 (1995)
Blake, C.L., Merz, C.J.: UCI Repository of Machine Learning Databases. Department of Information and Computer Science. University of California, Irvine (1998), www.ics.uci.edu/~mlearn/MLRepository.html
Goethals, B., Zaki, M.J.: FIMI Repository (2003), http://fimi.cs.helsinki.fi/fimi03/
Goethals, B.: Survey on Frequent Pattern Mining. University of Helsinki, Finland
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ashrafi, M.Z., Taniar, D., Smith, K. (2005). An Efficient Compression Technique for Frequent Itemset Generation in Association Rule Mining. In: Ho, T.B., Cheung, D., Liu, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2005. Lecture Notes in Computer Science(), vol 3518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11430919_16
Download citation
DOI: https://doi.org/10.1007/11430919_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26076-9
Online ISBN: 978-3-540-31935-1
eBook Packages: Computer ScienceComputer Science (R0)