实施关联规则算法识别订单中的热门顶部组合

Rizki Aulia Putra, Margareta Amalia Miranti Putri, Sri Maharani Sinaga, Sania Fitri Octavia, Raihan Catur Rachman
{"title":"实施关联规则算法识别订单中的热门顶部组合","authors":"Rizki Aulia Putra, Margareta Amalia Miranti Putri, Sri Maharani Sinaga, Sania Fitri Octavia, Raihan Catur Rachman","doi":"10.57152/predatecs.v1i2.863","DOIUrl":null,"url":null,"abstract":"Association rule is a data mining technique to find associative rules between a combination of items. This research aims to apply association rules algorithm in identifying popular topping combinations in food orders. This application aims to help restaurant owners or food businesses understand their customers' preferences and optimize their menu offerings. Data obtained from kaggle, the association rules algorithm is applied to this dataset to identify patterns or combinations of toppings that often appear together in orders. The results of this study show toppings with chocolate as a popular item in orders. These findings can provide valuable insights for food business owners in structuring their menus and determining attractive offers for customers. This study also applied a comparison between the apriori, fp- growth and eclat algorithms, with the result that the best item transaction rule was found: a combination of dill & unicorn toppings with chocolate with 60% confidence. Overall, the application of eclat algorithm in this study provides the best performance with higher execution speed, thus providing insight into customer preferences regarding topping combinations in food orders. Despite the shortcomings of the data form from this study, it is expected to help business owners in optimizing their offerings, increasing customer satisfaction, and improving their business performance.","PeriodicalId":516904,"journal":{"name":"Public Research Journal of Engineering, Data Technology and Computer Science","volume":"28 2","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Implementation of Association Rules Algorithm to Identify Popular Topping Combinations in Orders\",\"authors\":\"Rizki Aulia Putra, Margareta Amalia Miranti Putri, Sri Maharani Sinaga, Sania Fitri Octavia, Raihan Catur Rachman\",\"doi\":\"10.57152/predatecs.v1i2.863\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Association rule is a data mining technique to find associative rules between a combination of items. This research aims to apply association rules algorithm in identifying popular topping combinations in food orders. This application aims to help restaurant owners or food businesses understand their customers' preferences and optimize their menu offerings. Data obtained from kaggle, the association rules algorithm is applied to this dataset to identify patterns or combinations of toppings that often appear together in orders. The results of this study show toppings with chocolate as a popular item in orders. These findings can provide valuable insights for food business owners in structuring their menus and determining attractive offers for customers. This study also applied a comparison between the apriori, fp- growth and eclat algorithms, with the result that the best item transaction rule was found: a combination of dill & unicorn toppings with chocolate with 60% confidence. Overall, the application of eclat algorithm in this study provides the best performance with higher execution speed, thus providing insight into customer preferences regarding topping combinations in food orders. Despite the shortcomings of the data form from this study, it is expected to help business owners in optimizing their offerings, increasing customer satisfaction, and improving their business performance.\",\"PeriodicalId\":516904,\"journal\":{\"name\":\"Public Research Journal of Engineering, Data Technology and Computer Science\",\"volume\":\"28 2\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Public Research Journal of Engineering, Data Technology and Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.57152/predatecs.v1i2.863\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Public Research Journal of Engineering, Data Technology and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.57152/predatecs.v1i2.863","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

关联规则是一种数据挖掘技术,用于寻找项目组合之间的关联规则。本研究旨在应用关联规则算法来识别订餐中受欢迎的配料组合。该应用旨在帮助餐馆老板或食品企业了解顾客的喜好,优化菜单产品。数据来自 kaggle,关联规则算法应用于该数据集,以识别订单中经常出现的配料模式或组合。研究结果表明,巧克力配料是订单中最受欢迎的配料。这些发现可以为食品企业主提供有价值的见解,帮助他们设计菜单和确定对顾客有吸引力的产品。本研究还对 apriori、fp- growth 和 eclat 算法进行了比较,结果发现了最佳项目交易规则:莳萝和独角兽配料与巧克力的组合,置信度为 60%。总体而言,本研究中应用的 eclat 算法性能最佳,执行速度也更快,因此可以深入了解顾客对食品订单中配料组合的偏好。尽管这项研究的数据还存在不足,但它有望帮助企业主优化产品,提高客户满意度,改善企业业绩。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Implementation of Association Rules Algorithm to Identify Popular Topping Combinations in Orders
Association rule is a data mining technique to find associative rules between a combination of items. This research aims to apply association rules algorithm in identifying popular topping combinations in food orders. This application aims to help restaurant owners or food businesses understand their customers' preferences and optimize their menu offerings. Data obtained from kaggle, the association rules algorithm is applied to this dataset to identify patterns or combinations of toppings that often appear together in orders. The results of this study show toppings with chocolate as a popular item in orders. These findings can provide valuable insights for food business owners in structuring their menus and determining attractive offers for customers. This study also applied a comparison between the apriori, fp- growth and eclat algorithms, with the result that the best item transaction rule was found: a combination of dill & unicorn toppings with chocolate with 60% confidence. Overall, the application of eclat algorithm in this study provides the best performance with higher execution speed, thus providing insight into customer preferences regarding topping combinations in food orders. Despite the shortcomings of the data form from this study, it is expected to help business owners in optimizing their offerings, increasing customer satisfaction, and improving their business performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Application of Recurrent Neural Network Bi-Long Short-Term Memory, Gated Recurrent Unit and Bi-Gated Recurrent Unit for Forecasting Rupiah Against Dollar (USD) Exchange Rate Application of The Fuzzy Mamdani Method in Determining KIP-Kuliah Recipients for New Students Classifications of Offline Shopping Trends and Patterns with Machine Learning Algorithms Classification of Diabetes Mellitus Sufferers Eating Patterns Using K-Nearest Neighbors, Naïve Bayes and Decission Tree Evaluation of the Effectiveness of Neural Network Models for Analyzing Customer Review Sentiments on Marketplace
×
引用
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