An Improved Efficient FP-Growth Algorithm Using FP-TDA Algorithm


Authors : Abdulkader Mohammed Abdulla Al-Badani; Redwan Abbas Hussein Al-Dilami

Volume/Issue : Volume 10 - 2025, Issue 12 - December


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

Scribd : https://tinyurl.com/yhk9enkc

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

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 : Mining association rules is one of the most important tasks for uncovering hidden patterns in datasets to aid organizations in making efficient decisions based on customer behavior and preference. This association rule identifies other possible connections that may exist beyond customer preference and behavior. Some of the most prominent algorithms used in this regard are Apriori algorithms and FP-Growth algorithms. They help to obtain sufficient information based on huge datasets. However, association rule mining using existing algorithms has encountered several problems. They consume a huge memory space for data processing. They need data searching for finding out the frequency of each item. They also establish rules with low efficiency. In overcoming such problems engendered by data mining association rules, a better efficient Fp-TDA algorithm using advanced FP-Growth algorithms has recently been developed. This algorithm uses Matrix Tree instead of a tree concept used in existing algorithms. This largely cuts down data processing time. This concept largely cuts down frequently generated data. This concept largely addresses precision. This largely enhances data processing. This concept largely addresses efficiency. This largely addresses data quality. This largely addresses data time. This concept largely addresses memory space. The Fp-TDA largely addresses problems in association rule mining. This concept largely addresses data processing. This concept largely addresses data quality. This concept largely addresses data memory

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

References :

  1. WU, Bo, et al. 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, 2008. p. 1099-1102.‏
  2. RIADI, Imam, et al. Implementation of association rule using apriori algorithm and frequent pattern growth for inventory control. Jurnal Infotel, 2023, 15.4: 369-378.‏‏
  3. XIAO, Ling. Research on Education Data Association Rule Mining Based on Optimized Apriori Algorithm. In: 2023 7th Asian Conference on Artificial Intelligence Technology (ACAIT). IEEE, 2023. p. 1047-1051.‏‏
  4. YU, Chengqi; LIANG, Ying; ZHANG, Xinxin. Research on Apriori algorithm based on compression processing and hash table. In: Third International Conference on Machine Learning and Computer Application (ICMLCA 2022). SPIE, 2023. p. 606-611.‏
  5. ZHU, Siying. Analyse vehicle–pedestrian crash severity at intersection with data mining techniques. International journal of crashworthiness, 2022, 27.5: 1374-1382.‏‏
  6. HUAMAN LLANOS, Alex Alfredo, et al. Toward Enhanced Customer Transaction Insights: An Apriori Algorithm-based Analysis of Sales Patterns at University Industrial Corporation. International Journal of Advanced Computer Science & Applications, 2024, 15.2.‏‏
  7. WANG, Senzhang; CAO, Jiannong; PHILIP, S. Yu. Deep learning for spatio-temporal data mining: A survey. IEEE transactions on knowledge and data engineering, 2020, 34.8: 3681-3700.‏‏
  8. SALAM, Abu, et al. Pencarian Pola Asosiasi Untuk Penataan Barang Dengan Menggunakan Perbandingan Algoritma Apriori dan FP-Growth (Study Kasus Distro Epo Store Pemalang). Dinamik, 2018, 23.2: 57-65.
  9. FEBRIANTO, Moch Dwi; SUPRIYANTO, Aji. Implementasi Algoritma Apriori Untuk Menentukan Pola Pembelian Produk. JURIKOM (Jurnal Ris. Komputer), 2022, 9.6: 2010.‏‏‏
  10. HASAN, Md Mahamud; MISHU, Sadia Zaman. 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, 2018. p. 1-4.‏‏‏
  11. WEI, Fei; XIANG, Laisheng. Improved frequent pattern mining algorithm based on FP-Tree. In: Proceedings of The Fourth International Conference on Information Science and Cloud Computing (ISCC2015). 2015. p. 18-19.‏
  12. KRUPALI, Rana; GARG, Dweepna. Survey on the techniques of FP-growth tree for efficient frequent item-set mining. International Journal of Computer, 2017, 160.1: 40-43.‏‏‏
  13. GARG, Ritu; GULIA, Preeti. Comparative study of frequent itemset mining algorithms Apriori and FP growth. International Journal of Computer Applications, 2015, 126.4.‏‏‏
  14. AL-MAOLEGI, Mohammed; ARKOK, Bassam. An improved Apriori algorithm for association rules. arXiv preprint arXiv:1403.3948, 2014.‏‏‏
  15. AL-MAOLEGI, Mohammed; ARKOK, Bassam. An improved Apriori algorithm for association rules. arXiv preprint arXiv:1403.3948, 2014.‏
  16. GUPTA, Aditya; GUSAIN, Kunal; GOYAL, Lalit Mohan. Improved FP-Linked List Algorithm for Association Rule Mining. In: Advances in Computer and Computational Sciences: Proceedings of ICCCCS 2016, Volume 2. Springer Singapore, 2018. p. 559-569.‏‏‏‏‏
  17. SUBA, Saravanan; CHRISTOPHER, T. An Improved and Efficient Method to Discover the Frequent Patterns from Targeted Patterns in Transactional dataset using tpiitr-fpmm. international journal of advanced research in computer Science, 2017, 8.9.‏‏‏‏‏
  18. JIANG, Hao; HE, Xu. An Improved Algorithm for Frequent Itemsets Mining. In: 2017 Fifth International Conference on Advanced Cloud and Big Data (CBD). IEEE, 2017. p. 314-317.‏‏‏‏
  19. SIVANANTHAM, S., et al. Association Rule Mining Frequent-Pattern-Based Intrusion Detection in Network. Computer Systems Science & Engineering, 2023, 44.2.‏
  20. ZHIYUAN, Liu. Research on Association Rule Mining Algorithm Based on FP-tree. In: 2024 IEEE 4th International Conference on Electronic Technology, Communication and Information (ICETCI). IEEE, 2024. p. 1179-1184.‏
  21. ZHANG, Baohua. Optimization of FP-growth algorithm based on cloud computing and computer big data. International Journal of System Assurance Engineering and Management, 2021, 12.4: 853-863.‏‏‏‏‏‏‏‏‏
  22. CHANG, Hong-Yi, et al. A novel incremental data mining algorithm based on fp-growth for big data. In: 2016 International Conference on Networking and Network Applications (NaNA). IEEE, 2016. p. 375-378.‏
  23. LI, Ye-Bai, et al. Frequent pattern mining algorithm based on improved FP-tree. Jisuanji Yingyong/ Journal of Computer Applications, 2011, 31.1: 101-103.‏‏‏‏‏‏‏‏‏
  24. CHEN, Jin Bo, et al. A log analysis technology based on FP-growth improved algorithm. In: 2021 International conference on artificial intelligence, big data and Algorithms (CAIBDA). IEEE, 2021. p. 219-223.‏‏‏‏‏‏‏‏‏
  25. AQRA, Iyad, et al. Incremental algorithm for association rule mining under dynamic threshold. Applied Sciences, 2019, 9.24: 5398.‏‏‏‏‏‏‏‏‏
  26. EL HADI BENELHADJ, Mohamed; DEYE, Mohamed Mahmoud; SLIMANI, Yahya. Signature-based Tree for Finding Frequent Itemsets. Journal of Communications Software and Systems, 2023, 19.1: 70-80.‏‏‏‏‏‏‏‏‏
  27. CHANDRA, B.; BHASKAR, Shalini. A novel approach for finding frequent itemsets in data stream. International journal of intelligent systems, 2013, 28.3: 217-241.‏
  28. XUN, Yaling, et al. Incremental frequent itemsets mining based on frequent pattern tree and multi-scale. Expert Systems with Applications, 2021, 163: 113805.‏‏‏‏‏‏‏‏‏
  29. SONG, Wei; LIU, Wenbo; LI, Jinhong. Dynamic FP-Tree Pruning for Concurrent Frequent Itemsets Mining. In: International Symposium on Intelligence Computation and Applications. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. p. 111-120.‏‏‏‏‏‏‏‏‏
  30. DONG, Peng; CHEN, Bo. new algorithm of maximum frequent itemsets based on FP-tree for mining multiple-level association rules. In: 2008 International Conference on Computer Science and Software Engineering. IEEE, 2008. p. 263-266.‏
  31. LEUNG, Carson Kai-Sang; MACKINNON, Richard Kyle; TANBEER, Syed K. Fast algorithms for frequent itemset mining from uncertain data. In: 2014 IEEE International Conference on Data Mining. IEEE, 2014. p. 893-898.‏‏‏‏‏‏‏‏‏
  32. WINARTI, Titin; INDRIYAWATI, Henny. Data Mining Modeling Feasibility Patterns of Graduates Ability With Stakeholder Needs Using Apriori Algorithm. International Journal of Information Technology and Business, 2023, 4.2: 55-60.‏‏‏‏‏‏‏‏‏
  33. SIVAIAH, Borra; RAO, Ramisetty Rajeswara. A Novel Nodesets-Based Frequent Itemset Mining Algorithm for Big Data using MapReduce. International journal of electrical and computer engineering systems, 2023, 14.9: 1051-1058.‏‏‏‏‏‏‏‏‏
  34. RUSTOGI, Swati; SHARMA, Manisha; MORWAL, Sudha. Improved parallel apriori algorithm for multi-cores. International Journal of Information Technology and Computer Science (IJITCS), 2017, 9.4: 18.‏‏‏‏‏‏‏‏‏
  35. BLAKE, Catherine L. UCI repository of machine learning databases. http://www. ics. uci. edu/~ mlearn/MLRepository. html, 1998.‏

Mining association rules is one of the most important tasks for uncovering hidden patterns in datasets to aid organizations in making efficient decisions based on customer behavior and preference. This association rule identifies other possible connections that may exist beyond customer preference and behavior. Some of the most prominent algorithms used in this regard are Apriori algorithms and FP-Growth algorithms. They help to obtain sufficient information based on huge datasets. However, association rule mining using existing algorithms has encountered several problems. They consume a huge memory space for data processing. They need data searching for finding out the frequency of each item. They also establish rules with low efficiency. In overcoming such problems engendered by data mining association rules, a better efficient Fp-TDA algorithm using advanced FP-Growth algorithms has recently been developed. This algorithm uses Matrix Tree instead of a tree concept used in existing algorithms. This largely cuts down data processing time. This concept largely cuts down frequently generated data. This concept largely addresses precision. This largely enhances data processing. This concept largely addresses efficiency. This largely addresses data quality. This largely addresses data time. This concept largely addresses memory space. The Fp-TDA largely addresses problems in association rule mining. This concept largely addresses data processing. This concept largely addresses data quality. This concept largely addresses data memory

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

CALL FOR PAPERS


Paper Submission Last Date
31 - December - 2025

Video Explanation for Published paper

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe