K-Means的比较菜单工程中基于奇异值分解的k - means++聚类模型

Q3 Decision Sciences
Nina Setiyawati, Dwi Hosanna Bangkalang, Hindriyanto Dwi Purnomo
{"title":"K-Means的比较菜单工程中基于奇异值分解的k - means++聚类模型","authors":"Nina Setiyawati, Dwi Hosanna Bangkalang, Hindriyanto Dwi Purnomo","doi":"10.30630/joiv.7.3.1053","DOIUrl":null,"url":null,"abstract":"The menu is one of the most fundamental aspects of business continuity in the culinary industry. One of the tools that can be used for menu analysis is menu engineering. Menu engineering is an analytical tool that assists restaurants, companies, and small and medium-sized enterprises (SMEs) in assessing and making decisions on marketing strategies, menu design, and sales so that it can produce maximum profit. In this study, several menu engineering models were proposed, and the performance of these models was analyzed. This study used a dataset from the Point of Sales (POS) application in an SME engaged in the culinary field. This research consists of three stages. First, pre-processing the data, comparing the models, and evaluating the models using the Davies Bouldin index. At the model comparison stage, four models are being compared: K-Means, K-Means++, K-Means using Singular Value Decomposition (SVD), and K-Means++ using SVD. SVD is used in the dataset transformation process. K-Means and K-Means++ algorithms are used for grouping menu items. The experiments show that the K-Means++ model with SVD produced the most optimal cluster in this research. The model produced an average cluster distance value of 0.002; the smallest Davies-Bouldin Index (DBI) value is 0.141. Therefore, using the K-Means++ model with SVD in menu engineering analysis produces clusters containing menu items with high similarity and significant distance between groups. The results obtained from the proposed model can be used as a basis for strategic decision-making of managing price, marketing strategy, etc., for SMEs, especially in the culinary business.","PeriodicalId":32468,"journal":{"name":"JOIV International Journal on Informatics Visualization","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comparison of K-Means & K-Means++ Clustering Models using Singular Value Decomposition (SVD) in Menu Engineering\",\"authors\":\"Nina Setiyawati, Dwi Hosanna Bangkalang, Hindriyanto Dwi Purnomo\",\"doi\":\"10.30630/joiv.7.3.1053\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The menu is one of the most fundamental aspects of business continuity in the culinary industry. One of the tools that can be used for menu analysis is menu engineering. Menu engineering is an analytical tool that assists restaurants, companies, and small and medium-sized enterprises (SMEs) in assessing and making decisions on marketing strategies, menu design, and sales so that it can produce maximum profit. In this study, several menu engineering models were proposed, and the performance of these models was analyzed. This study used a dataset from the Point of Sales (POS) application in an SME engaged in the culinary field. This research consists of three stages. First, pre-processing the data, comparing the models, and evaluating the models using the Davies Bouldin index. At the model comparison stage, four models are being compared: K-Means, K-Means++, K-Means using Singular Value Decomposition (SVD), and K-Means++ using SVD. SVD is used in the dataset transformation process. K-Means and K-Means++ algorithms are used for grouping menu items. The experiments show that the K-Means++ model with SVD produced the most optimal cluster in this research. The model produced an average cluster distance value of 0.002; the smallest Davies-Bouldin Index (DBI) value is 0.141. Therefore, using the K-Means++ model with SVD in menu engineering analysis produces clusters containing menu items with high similarity and significant distance between groups. The results obtained from the proposed model can be used as a basis for strategic decision-making of managing price, marketing strategy, etc., for SMEs, especially in the culinary business.\",\"PeriodicalId\":32468,\"journal\":{\"name\":\"JOIV International Journal on Informatics Visualization\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"JOIV International Journal on Informatics Visualization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.30630/joiv.7.3.1053\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Decision Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOIV International Journal on Informatics Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30630/joiv.7.3.1053","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 0

摘要

菜单是烹饪行业业务连续性的最基本方面之一。可以用于菜单分析的工具之一是菜单工程。菜单工程是一种分析工具,帮助餐馆、公司和中小型企业(sme)评估和制定营销策略、菜单设计和销售决策,从而产生最大的利润。本文提出了几种菜单工程模型,并对这些模型的性能进行了分析。本研究使用了一家从事烹饪领域的中小企业的销售点(POS)应用程序的数据集。本研究分为三个阶段。首先,对数据进行预处理,比较模型,并使用Davies Bouldin指数对模型进行评价。在模型比较阶段,将比较四种模型:K-Means、k - means++、使用奇异值分解(SVD)的K-Means和使用SVD的k - means++。在数据集转换过程中使用奇异值分解。K-Means和k - means++算法用于对菜单项进行分组。实验表明,在本研究中,带有SVD的k - means++模型产生了最优的聚类。该模型产生的平均聚类距离值为0.002;davis - bouldin指数(DBI)最小值为0.141。因此,在菜单工程分析中使用k - means++模型与SVD相结合,可以产生包含相似度高、组间距离显著的菜单项的聚类。从所提出的模型中获得的结果可以作为中小企业管理价格,营销策略等战略决策的基础,特别是在烹饪业务中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparison of K-Means & K-Means++ Clustering Models using Singular Value Decomposition (SVD) in Menu Engineering
The menu is one of the most fundamental aspects of business continuity in the culinary industry. One of the tools that can be used for menu analysis is menu engineering. Menu engineering is an analytical tool that assists restaurants, companies, and small and medium-sized enterprises (SMEs) in assessing and making decisions on marketing strategies, menu design, and sales so that it can produce maximum profit. In this study, several menu engineering models were proposed, and the performance of these models was analyzed. This study used a dataset from the Point of Sales (POS) application in an SME engaged in the culinary field. This research consists of three stages. First, pre-processing the data, comparing the models, and evaluating the models using the Davies Bouldin index. At the model comparison stage, four models are being compared: K-Means, K-Means++, K-Means using Singular Value Decomposition (SVD), and K-Means++ using SVD. SVD is used in the dataset transformation process. K-Means and K-Means++ algorithms are used for grouping menu items. The experiments show that the K-Means++ model with SVD produced the most optimal cluster in this research. The model produced an average cluster distance value of 0.002; the smallest Davies-Bouldin Index (DBI) value is 0.141. Therefore, using the K-Means++ model with SVD in menu engineering analysis produces clusters containing menu items with high similarity and significant distance between groups. The results obtained from the proposed model can be used as a basis for strategic decision-making of managing price, marketing strategy, etc., for SMEs, especially in the culinary business.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
JOIV International Journal on Informatics Visualization
JOIV International Journal on Informatics Visualization Decision Sciences-Information Systems and Management
CiteScore
1.40
自引率
0.00%
发文量
100
审稿时长
16 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学术文献互助群
群 号:481959085
Book学术官方微信