Authors : Abdulkader Mohammed Abdulla Al-Badani; Abdualmajed Ahmed Ghaleb Al- Khulaid; Abeer A. Shujaaddeen

Volume/Issue : Volume 10 - 2025, Issue 11 - November

Google Scholar : https://tinyurl.com/3j6ye3bz

Scribd : https://tinyurl.com/z4r2z74y

DOI : https://doi.org/10.38124/ijisrt/25nov1256

Note : A published paper may take 4-5 working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and ResearchGate.

Note : Google Scholar may take 30 to 40 days to display the article.

Abstract : The goal of association rule mining is to identify patterns in big data sets. Businesses may make well-informed decisions based on consumer behavior and preferences by using these links to uncover patterns or correlations that might not be immediately apparent. Apriori and FP-Growth are two examples of algorithms that companies may use to effectively extract insightful information from their data.The association rule method does, however, have certain limitations, including the requirement for a lot of memory, the necessity for extensive dataset searches to ascertain the item set's frequency, and sometimes less-than-ideal rules. The efficient algorithm Fp-TDA, based on the FP-Growth algorithm, would reduce the number of frequently formed items and the amount of time spent mining by using the proposed matrix TDA instead of the tree used in those methods. This would result in a significant reduction of the amount of decision-making in large datasets. By reducing redundancy, this method not only speeds up data processing but also increases the correctness of the output. As a result, the Fp-TDA algorithm has the potential to greatly enhance data mining applications, particularly in domains like market research and fraud detection where accuracy and speed are crucial.

Keywords : FP-Growth Algorithm, Aprioiri Algorithm, FP-Tree, Support Count, TDA.

References :

1. WU, Bo, et al. 2008. An efficient frequent patterns mining algorithm based on apriori algorithm and the FP-tree structure. In: 2008 Third International Conference on Convergence and Hybrid Information Technology. IEEE. pp. 1099-1102.‏
2. Singh R, Bhala A, Salunkhe J, et al.2015. Optimized Apriori Algorithm Using Matrix Data Structure[J]. International Journal of Research in Engineering and AppSciences,9(5),pp.  2249-3905.
3. Yu, C., Liang, Y., & Zhang, X. 2023. Research on Apriori algorithm based on compression processing and hash table. In Third International Conference on Machine Learning and Computer Application (ICMLCA 2022) (Vol. 12636, pp. 606-611). SPIE.‏
4. SIAHAAN, Andysah Putera Utama; IKHWAN, Ali; ARYZA, Solly.2018. A novelty of data mining for promoting education based on FP-growth algorithm.‏
5. M. D. Febrianto and A. Supriyanto. , 2022. “Implementasi algoritma apriori untuk menentukan pola pembelian produk,” Jurikom, vol. 9, no. 6, pp. 2010–2020.
6. M. M. Hasan and S. Z. Mishu..2018. “An adaptive method for mining frequent itemsets based on apriori and fp growth algorithm,” in 2018 International Conference on Computer, Communication, Chemical, Material and Electronic Engineering (IC4ME2). IEEE, pp. 1–4.
7. A. Almira, S. Suendri, and A. Ikhwan, 2021.“Implementasi data mining menggunakan algoritma fp-growth pada analisis pola pencurian daya listrik,” Jurnal Informatika Universitas Pamulang, pp. 442–448.
8. J. Han, J. Pei, and Y. Yin. .2000. “Mining frequent patterns without candidate generation,” ACM sigmod record, no. 2, pp. 1– 12.
9. F. Wei and L. Xiang. 2015. “Improved frequent pattern mining algorithm based on fp-tree,” in Proceedings of The Fourth International Conference on Information Science and Cloud Computing (ISCC2015), pp. 18–19.
10. R. Krupali, D. Garg, and K. Kotecha. 2017. “An improved approach of fp-growth tree for frequent itemset mining using partition projection and parallel projection techniques,” International Recent and Innovation Trends in Computing and Communication, pp. 929–934.
11. AGRAWAL, Rakesh, et al. 1994. Fast algorithms for mining association rules. In: Proc. 20th int. conf. very large data bases, VLDB. pp. 487-499.‏
12. HAN, Jiawei; PEI, Jian; YIN, Yiwen. 2000. Mining frequent patterns without candidate generation. ACM sigmod record, 29.2: 1-12.
13. SHRIDHAR, M.; PARMAR. 2017. Mahesh. Survey on association rule mining and its approaches. Int J Comput Sci Eng, 5.3: 129-135.‏
14. KHANALI, Hoda; VAZIRI, Babak. 2017. A survey on improved algorithms for mining association rules. Int. J. Comput. A,pp. 165: 8887.
15. Sohrabi, M. K., & HASANNEJAD, M. H. 2016. Association rule mining using new FP-linked list algorithm.‏
16. BALA, Alhassan, et al. 2016. Performance analysis of apriori and fp-growth algorithms (association rule mining). Int. J. Computer Technology &Applications, 7.2,pp. 279-293.‏
17. Gruca, A. 2014. Improvement of FP-Growth algorithm for mining description-oriented rules. In Man-Machine Interactions, Part of Advances in Intelligent Systems and Computing,  (AISC), Springer, vol. 242, pp. 183-192.
18. Sohrabi, M.  K.,  and  Marzooni, H. H.  2016. Association rule mining using new FP-Linked list algorithm. Journal of Advances in Computer Research (JACR), 7(1),  pp. 23-34.‏
19. Bao, Y. Tang, B. Yang, X. Wang, J. Chen, and H. Xiong,2025. “Mining analysis of traffic accident features based on fp-growth algorithm and apriori algorithm,” vol. 13486, no. Cvaa 2024, pp. 1–5.
20. M. Kavitha and M. S. T. T. Selvi.2016. “Comparative Study on Apriori Algorithm and Fp Growth Algorithm with Pros and Cons,” Int. J. Comput. Sci. Trends Technol. (IJCS T), vol. 4, no. 4, pp. 161–164.
21. M. Shawkat, M. Badawi, and S. El.2021. “An optimized FP ‑ growth algorithm for discovery of association rules,” J. Supercomput., no. 0123456789.
22. M. El Hadi Benelhadj, M. M. Deye, and Y. Sliman. 2023. “Signaturebased tree for finding frequent itemsets,” Journal of Communications Software and Systems, pp. 70–80.
23. S. Bhise and S. Kale. 2017. “Effieient algorithms to find frequent itemset using data mining,” Int. Res. J. Eng. Technol., pp. 2645–2648.
24. AL-ZAWAIDAH, Farah Hanna; JBARA, Yosef Hasan; MARWAN, A. L. 2011.” An Improved Algorithm For Mining Association Rules In Large Databases”,World Of Computer Science And Information Technology Journal, 1.7,pp. 311-316.
25. Dr. Suyanto, S. M. 2017.”Data Mining Untuk Klasifikasi Dan Klasterisasi Data”, Bandung: Informatika.
26. WINARTI, Titin; INDRIYAWATI, Henny. 2023. Data Mining Modeling Feasibility Patterns of Graduates Ability With Stakeholder Needs Using Apriori Algorithm. International Journal of Information Technology and Business, 4.2,pp.  55-60.
27. GU, Juan; JIANG, Tianyuan; SHEN, Lei. 2023. Equipment maintenance data mining based on FP-growth algorithm. In: International Conference on Electronic  Information Engineering and Data Processing (EIEDP 2023). SPIE,. pp. 216-222.‏
28. Blake, C. L., and Merz., M. J, UCI Repository of Machine Learning Databases [http://www. ics.  uci.  edu/~ mlearn/ MLRepository.   html].   Irvine,   CA:   University   of   California‖, Department of Information and Computer Science.