Performance comparison of association rule mining algorithms among Apriori, FP-Growth, FP-Max, and H-Mine for market basket analysis

Main Article Content

Kritbodin Phiwhorm

Abstract

Association rule mining is a crucial technique for market basket analysis in retail businesses, but it often faces challenges in processing speed and memory usage, particularly with large-scale datasets. This research presents a performance comparison of four algorithms: Apriori, FP-Growth, FP-Max, and H-Mine, using a grocery store dataset for market basket analysis under varying support thresholds. The results showed that the H-Mine algorithm demonstrated superior performance in both execution time and memory usage, attributed to its efficient Hyperlink data structure, followed by FP-Growth and FP-Max algorithms, which employ FP-Tree structure to minimize database scanning. Meanwhile, the Apriori algorithm exhibited the lowest performance.

Article Details

Section
Original Articles

References

Adeniji, I. A., Saheed, Y. K., Oladele, T. O., & Braimah, J. O. (2015). Comparative analysis of association rule mining techniques for monitoring behavioural patterns of customers in a grocery store. International Journal of Computer Science and Information Security,

(1), 46–51.

Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB) (pp. 487–499). Morgan Kaufmann.

Borah, A., & Nath, B. (2021). Comparative evaluation of pattern mining techniques: An empirical study. Complex & Intelligent Systems, 7(2), 589–619. https://doi.org/10.1007/s40747-020-00226-4

Dedhia, H. (2022). Groceries dataset [Dataset]. Kaggle. https://www.kaggle.com/datasets/heeraldedhia/groceries-dataset/data

Gandomi, A., & Haider, M. (2015). Beyond the hype: Big data concepts, methods, and analytics. International Journal of Information Management, 35(2), 137–144. https://doi.org/10.1016/j.ijinfomgt.2014.10.007

Garg, K., & Kumar, D. (2013). Comparing the performance of frequent pattern mining algorithms. International Journal of Computer Applications, 69(25), 21–28. https://doi.org/10.5120/12129-8502

Grahne, G., & Zhu, J. (2003). High performance mining of maximal frequent itemsets. In Proceedings of the 3rd SIAM International Conference on Data Mining (pp. 135–143). SIAM.

Han, J., Kamber, M., & Pei, J. (2006). Data mining: Concepts and techniques (2nd ed.). Morgan Kaufmann.

Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (pp. 1–12). ACM. https://doi.org/10.1145/342009.335372

Mustakim, Herianda, D. M., Ilham, A., Daeng Gs, A., Laumal, F. E., Kurniasih, N., Iskandar, A., Manulangga, G., Indra Iswara, I. B. A., & Rahim, R. (2018). Market basket analysis using Apriori and FP-Growth for analysis consumer expenditure patterns at Berkah Mart in Pekanbaru Riau. Journal of Physics: Conference Series, 1114, 012131. https://doi.org/10.1088/1742-6596/1114/1/012131

Nigam, B., Nigam, A., & Dalal, P. (2017). Comparative study of top 10 algorithms for association rule mining. International Journal of Computer Sciences and Engineering, 5(8), 190–195. https://doi.org/10.26438/ijcse/v5i8.190195

Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., & Yang, D. (2001). H-mine: Hyper-structure mining of frequent patterns in large databases. In Proceedings 2001 IEEE International Conference on Data Mining (pp.441–448). IEEE. https://doi.org/10.1109/ICDM.2001.989550

Raschka, S. (2018). MLxtend: Providing machine learning and data science utilities and extensions to Python’s scientific computing stack. Journal of Open Source Software, 3(24), 638. https://doi.org/10.21105/joss.00638

Slimani, T., & Lazzez, A. (2014). Efficient analysis of pattern and association rule mining approaches. International Journal of Information Technology and Computer Science, 6(3), 70–81. https://doi.org/10.5815/ijitcs.2014.03.09

Wicaksono, D., Jambak, M. I., & Saputra, D. M. (2020). The comparison of Apriori algorithm with preprocessing and FP-Growth algorithm fWor finding frequent data pattern in association rule. In Proceedings of the Sriwijaya International Conference on Information Technology and Its Applications (SICONIAN 2019) (pp. 574–579). Atlantis Press.