Comparative Analysis of Algorithms for Mining Frequent Patterns

Authors

  • A. Selva Priya PG Scholar, Department of Computer Science and Engineering, Government College of Technology, Coimbatore, Tamil Nadu, India

Keywords:

Growth Algorithm, Data mining, frequent pattern mining, Apriori, FP-growth

Abstract

In the computerized world, everything is moving online, and data comes in different shapes and sizes and is collected in different ways. By using data mining, frequent patterns in the databases can be identified, and it can be used in numerous applications. Finding frequent patterns in huge databases is important because it reveals important information that cannot be found through simple data surfing. To find common patterns, a variety of methods are utilized, each of which performs differently. The fundamental methods used in frequent pattern mining are Apriori and FP-growth. The functioning and experimental results of various algorithms are compared in this study, and their benefits and drawbacks are discussed.

References

Bhadoria, et al. Analysis of frequent itemset mining on variant datasets, published in int J Comp Tech Appl. 2(5): ISSN:2229–6093, 2011;2(5):1328–33.

Agarwal RC, Agarwal CC, Prasad VVV. A tree projection algorithm for generation of frequent item sets. J Parallel Distrib Comput. 2001; 61(3): 350–371.

Panchal Mayur, Ladumor Dhara, Kapadiya Jahnvi, Desai Piyusha, Patel Tushar S. An analytical study of various frequent itemset mining algorithms, Res J Comput Inf Technol Sci. 2013; 1(1):6–9.

Wikipedia Contributors. Database transaction . Wikipedia. Wikimedia Foundation; 2023. Available from: https://en.wikipedia.org/wiki/Database_transaction

Imielienskin T, Swami A, Agrawal R. Mining association rules between set of items in large databases, in Management of Data, 1993; 9. pp. 207–216

Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Databases, VLDB. 1994; 1215: 487–499.

Olawuni Deborah Monisola, et al. Inhibitors to women's right to the occupation of land: a closer look at Ajebamidele Community in Ile-Ife, Nigeria. Property Management. 2022. 40(5):690–705.

Sourav S. Bhowmick Qiankun Zhao, Association Rule Mining: A Survey, Nanyang Technological University, Singapore, 2003. pg no 1–20

Nasreen Shamila, et al. Frequent pattern mining algorithms for finding associated frequent patterns for data streams: A survey. Procedia Comput Sci. 2014; 37: 109–116.

Goethals Bart. Survey on frequent pattern mining. Univ. of Helsinki. 2003; 19: 840–852.

Mohammed J. Zaki, Scalable Algorithms for Association Mining, IEEE Trans Knowl Data Eng. 2002; 372–390. vol no 12(3)

Chistopher T, PhD Saravanan Suba, A study on milestones of association rule mining, Int J Comput Appl. June 2012, 7. 47(3):12–9.

Agrawal R, Mannila H, Srikanth R, Toivonen H, Verkamo AI. Fast discovery of association rules. In: Fayyad UM, Piatetsky-Shapiro G, Smyth P, Uthurusamy R (Eds.) Advances in knowledge discovery and data mining, 1996; 307–328.

Ke-Chung L, Liao IE, Sheng C. An improved frequent pattern growth method for mining association rules. Expert Syst Appl. 2011; 38(5): 5154.

Kavitha M, Selvi ST. Comparative study on Apriori algorithm and Fp growth algorithm with pros and cons. Int J Comput Sci Trends Technol (IJCST). 2016; 4(4):161–4.

Mittal A, Nagar A, Gupta K, Nahar R. Comparative study of various Frequent Pattern Mining algorithms. International Journal of Advanced Research in Computer and Communication Engineering. 2015 Apr;4(4):550–3.

Jian Pei, Jiawei Han, Mining Frequent patterns without candidate generation, in SIGMOD '00 Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, New York, NY, USA, 2000, 1–12.

Fitzsimon Jayden, et al. A shapley value index for market basket analysis: efficient computation using an harsanyi dividend representation. Int Game Theory Rev (IGTR). 2022; 24(04): 1–29.

Yabing J. Research of an improved apriori algorithm in data mining association rules. Int J Comput Commun Eng. 2013; 2(1): 25.

Srinivasan Parthasarathy, Wei Li Mohammed Javeed Zaki, A localized algorithm for parallel association mining, In 9th ACM Symp. Parallel Algorithms & Architectures. 1997. Jun 1 (pp. 321–330)

Zaki MJ. Fast mining of sequential patterns in very large databases. University of Rochester Computer Science Department, New York, 1997.

Hu Ya-Han, Yen-Liang Chen. Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism. Decis Support Syst. 2006; 42(1): 1–24.

Srikrishnaswetha Kone, Sandeep Kumar, Md Rashid Mahmood. A study on smart electronics voting machine using face recognition and aadhar verification with IoT. Innovations in Electronics and Communication Engineering: Proceedings of the 7th ICIECE 2018. Springer Singapore, 2019.

Goswami DN, et al. An algorithm for frequent pattern mining based on Apriori, (IJCSE) Int J Comput Sci Eng. 2010; 02(04): 942–947.

Anurag Choubey, Ravindra Patel, Rana JL. A survey of efficient algorithms and new approach for fast discovery of frequent item set for association rule mining, Int J Soft Comput Eng. 2011. pg no 2231–307.

Sathish Kumar, et al. Efficient tree based distributed data mining algorithms for mining frequent patterns, Int J Comput Appl. November 2010; 10(1): (0975–8887).

Patil Manoj, Tejashri Patil. Apriori algorithm against FP growth algorithm: a comparative study of data mining algorithms. Available at SSRN 4113695 (2022).

Deepak Garg, et. al. Comparative analysis of various approaches used in frequent pattern mining, (IJACSA) Int J Adv Comput Sci Appl. Special Issue on Artificial Intelligence. pg 141–146

Garg Kanwal, Deepak Kumar. Comparing the performance of frequent pattern mining algorithms. Int J Comput Appl. 2013; 69(25). 29–32

Chen IZ, et al. Image processing and capsule networks. Adv Intell Syst Comput. 2020; 19(20):

–139.

Shawkat Mai, et al. An optimized FP-growth algorithm for discovery of association rules. J Supercomput. 2022; 78(4), 1–28

Hasan Md Mahamud, Sadia Zaman Mishu. An adaptive method for mining frequent itemsets based on apriori and FP growth algorithm. 2018 International Conference on Computer, Communication, Chemical, Material and Electronic Engineering (IC4ME2). IEEE, 2018.

Borah Anindita, Bhabesh Nath. Tree based frequent and rare pattern mining techniques: a comprehensive structural and empirical analysis. SN Appl Sci. 2019; 1: 1–18.

Jiawei Han, Hong Cheng, Dong Xin, Xifeng Yan, Frequent pattern mining: current status and future directions, Data Mining Knowl Discov. 2007; 15(I): 32.

Chu Tsai-Pin, Fan Wu, Shih-Wen Chiang. Mining frequent pattern using item-transformation method. Fourth Annual ACIS International Conference on Computer and Information Science (ICIS'05). IEEE, 2005.

Borgelt C. Efficient implementations of Apriori and Eclat, In 1st IEEE ICDM Workshop on Frequent Item Set, 2003, 9.

Siswanto Boby, Evawaty Tanuar, Rissa Rahmania. Reshaped and reduced dimensionality reduction data technique on association rule mining. 2021 3rd International Symposium on Material and Electrical Engineering Conference (ISMEE). IEEE, 2021.

Hadzic Fedja, Henry Tan, Tharam S. Dillon. Mining of data with complex structures. Vol. 333. New York: Springer, 2010.

Borah A, Nath B. Comparative evaluation of pattern mining techniques: an empirical study. Complex Intell Syst. 2021; 7: 589–619.

Han Jiawei, Hong Cheng, Dong Xin, Xifeng Yan. Frequent pattern mining: current status and future directions. Data Min Knowl Discov. 2007; 15(1): 55–86.

Hasan Md Mahamud, Sadia Zaman Mishu, An adaptive method for mining frequent itemsets based on apriori and FP growth algorithm. 2018 International Conference on Computer, Communication, Chemical, Material and Electronic Engineering (IC4ME2). IEEE, 2018.

Aggarwal Charu C, Mansurul A. Bhuiyan, and Mohammad Al Hasan. Frequent pattern mining algorithms: A survey. Springer International Publishing, 2014.

Published

2023-09-20