TY - JOUR
T1 - Performance Analysis of Association Rule Mining Algorithms
T2 - Evidence from the Retailing Industry
AU - Mohanty, Bijayini
AU - Tripathy, Murchhana
AU - Champati, Santilata
N1 - Publisher Copyright:
© 2023 School of Science, IHU. All Rights Reserved.
PY - 2023
Y1 - 2023
N2 - The Apriori and FP-growth algorithms have gained widespread popularity in various business applications. In the retailing industry they are widely used for market-basket data analysis and frequent pattern mining to gain valuable insights into customer purchasing behaviour. In this study, we conducted a comprehensive analysis of these two prominent association rules mining algorithms, utilizing six benchmark datasets from the UCI machine learning repository. Our investigation involved a thorough comparison of the execution time and the number of rules generated by both algorithms. Execution time is measured once by varying the support levels and next by varying the number of transactions and the support levels. Number of rules generated is estimated by varying the support levels of the rules. Through our rigorous experimentation, we derived insightful inferences that elucidated the utility of association rule mining in the retail industry. Moreover, we employed the Big-O method to compare the performance of the two algorithms and formulated a theorem that established FP-growth as Big-O of Apriori, substantiating the differences observed in their performance.
AB - The Apriori and FP-growth algorithms have gained widespread popularity in various business applications. In the retailing industry they are widely used for market-basket data analysis and frequent pattern mining to gain valuable insights into customer purchasing behaviour. In this study, we conducted a comprehensive analysis of these two prominent association rules mining algorithms, utilizing six benchmark datasets from the UCI machine learning repository. Our investigation involved a thorough comparison of the execution time and the number of rules generated by both algorithms. Execution time is measured once by varying the support levels and next by varying the number of transactions and the support levels. Number of rules generated is estimated by varying the support levels of the rules. Through our rigorous experimentation, we derived insightful inferences that elucidated the utility of association rule mining in the retail industry. Moreover, we employed the Big-O method to compare the performance of the two algorithms and formulated a theorem that established FP-growth as Big-O of Apriori, substantiating the differences observed in their performance.
UR - http://www.scopus.com/inward/record.url?scp=85177179925&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85177179925&partnerID=8YFLogxK
U2 - 10.25103/jestr.165.14
DO - 10.25103/jestr.165.14
M3 - Article
AN - SCOPUS:85177179925
SN - 1791-9320
VL - 16
SP - 108
EP - 122
JO - Journal of Engineering Science and Technology Review
JF - Journal of Engineering Science and Technology Review
IS - 5
ER -