Abstract
Data mining is the process of collecting, extracting and analyzing large data set from different perspectives. Fundamental and important task of data mining is the mining of frequent itemsets. Frequent itemsets play an important role in association rule mining. Many researchers invented ideas to generate the frequent itemsets. The execution time required for generating frequent itemsets play an important role. This study yields a detailed analysis of the FP-Growth, Eclat and SaM algorithms to illustrate the performance with standard datasets Hepatitis and Adault. The comparative study of FP-Growth, Eclat and SaM algorithms includes aspects like different support values and different datasets.
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
Tan, P.N., Steinbach, M., Kumar, V.: Introduction to data mining. Addison Wesley Publishers (2006)
Che, M.S., Han, Yu, P.S.: Data Mining: An Overview from a Database Perspective. Proc. of the IEEE Transactions on Knowledge and Data Engineering 8(6), 866–883 (1996)
Han, J., Pei, H., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. Conf. on the Management of Data (SIGMOD 2000), Dallas, TX, ACM Press, New York (2000)
Pramod, S., Vya, O.P.: Survey on Frequent Itemset Mininbg Algorithms. International Journal of Computer Applications (0975 - 8887)
Borgelt, C.: Efficient Implementations of Apriori and Eclat. In: Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations. CEUR Workshop Proceedings 90, Aachen, Germany (2003)
Borgelt, C.: SaM: Simple Algorithms for Frequent Item Set Mining. IFSA/EUSFLAT 2009 Conference (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Kumar, K.P., Arumugaperumal, S. (2013). An Analytical Study on Frequent Itemset Mining Algorithms. In: Prasath, R., Kathirvalavakumar, T. (eds) Mining Intelligence and Knowledge Exploration. Lecture Notes in Computer Science(), vol 8284. Springer, Cham. https://doi.org/10.1007/978-3-319-03844-5_60
Download citation
DOI: https://doi.org/10.1007/978-3-319-03844-5_60
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03843-8
Online ISBN: 978-3-319-03844-5
eBook Packages: Computer ScienceComputer Science (R0)