Finding Customer Patterns Using FP-Growth Algorithm for Product Design Layout Decision Support

Erna Haerani, C. Juliane
{"title":"Finding Customer Patterns Using FP-Growth Algorithm for Product Design Layout Decision Support","authors":"Erna Haerani, C. Juliane","doi":"10.32520/stmsi.v11i2.1762","DOIUrl":null,"url":null,"abstract":"The transaction database contains a very large and irregular dataset that requires another mechanism to read it, even though there is a lot of new knowledge that can be revealed, including associations or relationships between goods or products that are often purchased by customers. The new finding of the relationship between these variables is usually called association rule mining. The algorithm that is developing and often used is frequent pattern-growth (FP-Growth). The problem of very many transaction databases also occurred in Mr. A. So, in this research, we will look for customer patterns using the FP-Growth algorithm. The algorithm aims to find the maximum frequent itemset. The frequent itemset will be generated into associative rules so that it becomes valuable new knowledge. This knowledge can be used as a reference and consideration in making decisions. The FP-Growth algorithm will be implemented using the rapidminer tools on the transaction data of Mr.A's goods sales. The pattern of rules that will be searched for is based on data on sales of goods transactions. The results of the study obtained six association rules with five conclusions being the gift category. So that the suggestion for decision making is to lay out items close to and around the gift category in order to improve marketing and service strategies in order to attract the attention and interest of pointers in making purchases of goods.","PeriodicalId":32367,"journal":{"name":"Sistemasi Jurnal Sistem Informasi","volume":"11 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sistemasi Jurnal Sistem Informasi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32520/stmsi.v11i2.1762","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The transaction database contains a very large and irregular dataset that requires another mechanism to read it, even though there is a lot of new knowledge that can be revealed, including associations or relationships between goods or products that are often purchased by customers. The new finding of the relationship between these variables is usually called association rule mining. The algorithm that is developing and often used is frequent pattern-growth (FP-Growth). The problem of very many transaction databases also occurred in Mr. A. So, in this research, we will look for customer patterns using the FP-Growth algorithm. The algorithm aims to find the maximum frequent itemset. The frequent itemset will be generated into associative rules so that it becomes valuable new knowledge. This knowledge can be used as a reference and consideration in making decisions. The FP-Growth algorithm will be implemented using the rapidminer tools on the transaction data of Mr.A's goods sales. The pattern of rules that will be searched for is based on data on sales of goods transactions. The results of the study obtained six association rules with five conclusions being the gift category. So that the suggestion for decision making is to lay out items close to and around the gift category in order to improve marketing and service strategies in order to attract the attention and interest of pointers in making purchases of goods.
基于FP-Growth算法的产品设计布局决策支持客户模式研究
事务数据库包含一个非常大且不规则的数据集,需要另一种机制来读取它,即使可以揭示许多新知识,包括客户经常购买的商品或产品之间的关联或关系。这些变量之间关系的新发现通常被称为关联规则挖掘。频繁模式增长(FP-Growth)算法正在发展并经常被使用。非常多的事务数据库的问题也发生在a先生身上。因此,在本研究中,我们将使用FP-Growth算法寻找客户模式。该算法旨在找到最大频繁项集。频繁项集将被生成关联规则,从而成为有价值的新知识。这些知识可以作为决策的参考和考虑。FP-Growth算法将使用rapidminer工具对Mr.A的商品销售交易数据进行实现。将搜索的规则模式基于商品交易的销售数据。研究结果获得了6条关联规则,其中5条结论是礼物类别。因此,为决策提供的建议是,在礼品类别附近和周围布置物品,以改进营销和服务策略,以吸引购买商品的指针的注意和兴趣。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
66
审稿时长
43 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信