Retail Business Convenience Segmentation using Clustering and Data Visualization

Thirunavukkarasu. J, Sanjanaa. J, Sivarakshana. M, Yuvashree. R
{"title":"Retail Business Convenience Segmentation using Clustering and Data Visualization","authors":"Thirunavukkarasu. J, Sanjanaa. J, Sivarakshana. M, Yuvashree. R","doi":"10.1109/ACCAI58221.2023.10200947","DOIUrl":null,"url":null,"abstract":"The conventional approach to launching a business is to research and gather data regarding the past performance of rival businesses unless they were profitable or unsuccessful. Innovation is the ethos of the modern day, as everyone is engaged in a struggle to outperform one another. The objective of our suggested research is to create knowledge that will be helpful to aspiring business owners and small companies that are losing money. Our main aim is to assist small-scale manufacturers in becoming successful marketers. In return for the dataset, which must be provided as input, we will provide them with clear instructions on how to start a profitable business and recover from their loss. In order to analyse data more effectively, our planned work will segment clients based on stock input, weekly updates of stocks sold, and waste products. In this work, two different clustering techniques (k-Means and hierarchical) are used to classify the products into subsets, and their respective results are compared. Data will be segmented using clustering algorithms, allowing for much more focused production of the final result.","PeriodicalId":382104,"journal":{"name":"2023 International Conference on Advances in Computing, Communication and Applied Informatics (ACCAI)","volume":"200 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Advances in Computing, Communication and Applied Informatics (ACCAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACCAI58221.2023.10200947","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The conventional approach to launching a business is to research and gather data regarding the past performance of rival businesses unless they were profitable or unsuccessful. Innovation is the ethos of the modern day, as everyone is engaged in a struggle to outperform one another. The objective of our suggested research is to create knowledge that will be helpful to aspiring business owners and small companies that are losing money. Our main aim is to assist small-scale manufacturers in becoming successful marketers. In return for the dataset, which must be provided as input, we will provide them with clear instructions on how to start a profitable business and recover from their loss. In order to analyse data more effectively, our planned work will segment clients based on stock input, weekly updates of stocks sold, and waste products. In this work, two different clustering techniques (k-Means and hierarchical) are used to classify the products into subsets, and their respective results are compared. Data will be segmented using clustering algorithms, allowing for much more focused production of the final result.
基于聚类和数据可视化的零售业务便利性细分
传统的创业方法是研究和收集有关竞争对手企业过去业绩的数据,除非它们是盈利的或失败的。创新是现代社会的精神,因为每个人都在为超越他人而奋斗。我们建议研究的目的是创造对有抱负的企业主和正在亏损的小公司有帮助的知识。我们的主要目标是帮助小型制造商成为成功的营销人员。作为对数据集的回报,必须作为输入提供,我们将为他们提供关于如何开始盈利业务和从损失中恢复的明确指示。为了更有效地分析数据,我们计划的工作将根据库存输入、每周更新的库存销售和废品对客户进行细分。在这项工作中,使用两种不同的聚类技术(k-Means和hierarchical)将产品分类为子集,并比较了它们各自的结果。数据将使用聚类算法进行分割,从而使最终结果更加集中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信