Evaluating the Performance of Association Rules in Apriori and FP-Growth Algorithms: Market Basket Analysis to Discover Rules of Item Combinations

D. Dwiputra, Agung Mulyo Widodo, Habibullah Akbar, Gerry Firmansyah
{"title":"Evaluating the Performance of Association Rules in Apriori and FP-Growth Algorithms: Market Basket Analysis to Discover Rules of Item Combinations","authors":"D. Dwiputra, Agung Mulyo Widodo, Habibullah Akbar, Gerry Firmansyah","doi":"10.58344/jws.v2i8.403","DOIUrl":null,"url":null,"abstract":"This study focuses on applying data mining techniques, especially association rules mining using the Apriori and FP-GROWTH algorithms, for market basket analysis on PT. XYZ is a pharmaceutical company in Indonesia. A quantitative methodology uses a dataset of 100,498 transactions originating from 432,356 rows of data covering July to December 2022 in the JABODETABEK area. Apriori and FP-GROWTH algorithms are applied for association rules mining. The results show that FP-GROWTH has the fastest execution time of 84,655 seconds. However, the memory usage for the Apriori algorithm is the lowest at 482.32 MiB, with increments of: 0.21 MiB. For the rules generated, the two algorithms, both Apriori and FP-GROWTH, produce the same number of rules and values of support, confidence, lift, Bi-Support, Bi-Confidence, and Bi-Lift. In conclusion, Apriori is recommended for sales datasets if memory usage and ease of implementation are important. However, if the speed of execution time and a large amount of data are considered, FP-GROWTH is a better choice because the execution time is faster for large amounts of data. However, the choice of algorithm depends on the specific analysis objectives, itemset size, data scale, and computational capabilities. Results from association rules mining provide evidence of product popularity, purchasing patterns, and opportunities for strategic marketing and inventory management. These findings can help PT. XYZ improves business efficiency, understands customer behavior, and increases profitability.","PeriodicalId":45058,"journal":{"name":"World Journal of Science Technology and Sustainable Development","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2023-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Journal of Science Technology and Sustainable Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.58344/jws.v2i8.403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This study focuses on applying data mining techniques, especially association rules mining using the Apriori and FP-GROWTH algorithms, for market basket analysis on PT. XYZ is a pharmaceutical company in Indonesia. A quantitative methodology uses a dataset of 100,498 transactions originating from 432,356 rows of data covering July to December 2022 in the JABODETABEK area. Apriori and FP-GROWTH algorithms are applied for association rules mining. The results show that FP-GROWTH has the fastest execution time of 84,655 seconds. However, the memory usage for the Apriori algorithm is the lowest at 482.32 MiB, with increments of: 0.21 MiB. For the rules generated, the two algorithms, both Apriori and FP-GROWTH, produce the same number of rules and values of support, confidence, lift, Bi-Support, Bi-Confidence, and Bi-Lift. In conclusion, Apriori is recommended for sales datasets if memory usage and ease of implementation are important. However, if the speed of execution time and a large amount of data are considered, FP-GROWTH is a better choice because the execution time is faster for large amounts of data. However, the choice of algorithm depends on the specific analysis objectives, itemset size, data scale, and computational capabilities. Results from association rules mining provide evidence of product popularity, purchasing patterns, and opportunities for strategic marketing and inventory management. These findings can help PT. XYZ improves business efficiency, understands customer behavior, and increases profitability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
评价Apriori和FP-Growth算法中关联规则的性能:发现商品组合规则的购物篮分析
本研究的重点是应用数据挖掘技术,特别是使用Apriori和FP-GROWTH算法的关联规则挖掘,用于PT. XYZ是印度尼西亚的一家制药公司的市场篮子分析。定量方法使用来自JABODETABEK地区2022年7月至12月的432,356行数据的100,498笔交易的数据集。关联规则挖掘采用Apriori和FP-GROWTH算法。结果表明,FP-GROWTH的执行时间最快,为84,655秒。然而,Apriori算法的内存使用最低,为482.32 MiB,增量为0.21 MiB。对于生成的规则,两种算法(Apriori和FP-GROWTH)产生相同数量的规则和support、confidence、lift、Bi-Support、Bi-Confidence和Bi-Lift的值。总之,如果内存使用和易于实现很重要,建议使用Apriori来处理销售数据集。但是,如果考虑到执行时间的速度和大数据量,则FP-GROWTH是更好的选择,因为大数据量的执行时间更快。然而,算法的选择取决于具体的分析目标、项目集大小、数据规模和计算能力。关联规则挖掘的结果为战略营销和库存管理提供了产品受欢迎程度、购买模式和机会的证据。这些发现可以帮助PT. XYZ提高业务效率,了解客户行为,并增加盈利能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
World Journal of Science Technology and Sustainable Development
World Journal of Science Technology and Sustainable Development GREEN & SUSTAINABLE SCIENCE & TECHNOLOGY-
CiteScore
5.50
自引率
0.00%
发文量
0
期刊最新文献
Analysis of CT Numbers in Thoracic CT Scan Image Segmentation and Spirometry on Pulmonary Vital Capacity Mucinous Tubular and Spindle Cell Carcinoma of Kidney: A Case Report of a Rare Tumor AI'S Healing Touch: Examining Machine Learning's Transformative Effects On Healthcare The impact of Economic Growth, Foreign Investment, Wages, and Human Development Index on Educated Unemployment Generasi Z’s Perception of Dining Experience at Korea Restaurants, South Jakarta
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1