Abstract
Association Rule Mining (ARM) is one of the most prominent areas in detecting pattern analysis especially for crucial business decision making. With the aims to extract interesting correlations, frequent patterns, association or casual structures among set of items in the transaction databases or other data repositories, the end product of association rule mining is the analysis of pattern that could be a major contributor especially in managerial decision making. Most of previous frequent mining techniques are dealing with horizontal format of their data repositories. However, the current and emerging trend exists where some of the research works are focusing on dealing with vertical data format and the rule mining results are quite promising. One example of vertical rule mining technique is called Eclat which is the abbreviation of Equivalence Class Transformation. In response to the promising results of the vertical format and mining in a higher volume of data, in this study we propose a new model called an Incremental-Eclat adopting via relational database management system, MySQL (My Structured Query Language) that serves as our association rule mining database engine in testing benchmark Frequent Itemset Mining (FIMI) datasets from online repository. The experimental results of our proposed model outperform the traditional Eclat with certain order of magnitude.
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
References
Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of 20th international conference on very large data bases (VLDB), vol 1215, pp 487–499
Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Record 22(2):207–216
Abdullah Z, Herawan T, Deris MM (2010) Scalable model for mining critical least association rules. In: Information computing and applications. Springer Berlin Heidelberg, pp 509–516
Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Record 29(2):1–12
Zaki MJ, Parthasarathy S, Ogihara M, Li W et al (1997) New algorithms for fast discovery of association rules. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining (KDD’97), pp 283–286
Zaki MJ, Gouda K (2003) Fast vertical mining using diffsets. In: In Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 326–335
Shenoy P, Haritsa JR, Sudarshan S, Bhalotia G, Bawa M, Shah D (2000) Turbo-charging vertical mining of large databases. ACM SIGMOD Record 29(2):22–33
Trieu TA, Kunieda Y (2012) An improvement for declat algorithm. In: Proceedings of the 6th international conference on ubiquitous information management and communication (ICUIMC’12), vol 54, pp 1–6
Hipp J, Güntzer U, Nakhaeizadeh G (2000) Algorithms for association rule mining: a general survey and comparison. ACM SIGKDD Explor Newslett 2(1):58–64
Borgelt C (2003) Efficient implementations of apriori and eclat. In: Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations (FIMI03)
Schmidt-Thieme L (2004) Algorithmic features of eclat. In: Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations (FIMI04)
Goethals B (2010) Frequent set mining. In: Data mining and knowledge discovery handbook. Springer, pp 321–338
Borgelt C, Kruse R (2002) Induction of association rules: apriori implementation. In: Compstat. Springer, pp 395–400
Bakar WAWA, Saman MYM, Jalil MA (2014) Mining educational data: a review on student’s pattern of behaviours and performances. Int J Adv Comput Sci Appl 4:247–252
Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372–390
Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Disc 15(1):55–86
Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Disc 8(1):53–87
Yu X, Wang H (2014) Improvement of eclat algorithm based on support in frequent itemset mining. J Comput 9(9):2116–2123
Toivonen H (1996) Sampling large databases for association rules. In: Proceeding of the 22nd international conference on very large data bases (VLDB ‘96), pp 134–145
Slimani T, Lazzez A (2014) Efficient analysis of pattern and association rule mining approaches. Int J Inf Technol Comput Sci 6(3):70–81
Man M, Rahim MSM, Zakaria MZ, Bakar WAWA (2011) Spatial information databases integration model. In: Manaf AA et al (eds) ICIEIS 2011. Springer, Informatics Engineering and Information Science, pp 77–90
Savasere A, Omiecinski ER, Navathe SB (1995) An efficient algorithm for mining association rules in large databases. In: Proceeding of the 21th international conference on very large data bases (VLDB ‘95), pp 432–444
Acknowledgment
We express our gratitude to MyPhD scholarship under MyBrain15 of Kementerian Pendidikan Malaysia (KPM) and also to UM research grant and UKM research grant from Research Acceleration Center Excellence (RACE) for the financial foundation of this work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Bakar, W.A.B.W.A. et al. (2016). Incremental-Eclat Model: An Implementation via Benchmark Case Study. In: Soh, P., Woo, W., Sulaiman, H., Othman, M., Saat, M. (eds) Advances in Machine Learning and Signal Processing. Lecture Notes in Electrical Engineering, vol 387. Springer, Cham. https://doi.org/10.1007/978-3-319-32213-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-32213-1_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-32212-4
Online ISBN: 978-3-319-32213-1
eBook Packages: EngineeringEngineering (R0)