Implementasi Data Mining Transaksi Penjualan Menggunakan Algoritma Clustering dengan Metode K-Means

Nur Afiasari, Nana Suarna, Nining Rahaningsi
{"title":"Implementasi Data Mining Transaksi Penjualan Menggunakan Algoritma Clustering dengan Metode K-Means","authors":"Nur Afiasari, Nana Suarna, Nining Rahaningsi","doi":"10.33020/saintekom.v13i1.402","DOIUrl":null,"url":null,"abstract":"The large number of products sold by the Bill Lights Store resulted in a stockpile of several product items due to the large supply of products that were less attractive to customers, resulting in many unsold and under-sold products. Bill Lights struggles with inventory levels of sold and unsold products, as well as shortages and overstocks. Bill Lights stores should rank each product so that they know which products are in the most demand. The purpose of this research is to solve the problem of using inventory information by grouping inventory products based on product characteristics using data mining techniques. The technique used is the K-Means algorithm method. K-Means algorithm clustering method and RapidMiner software processing. The data mining process starts with data processing (selection, cleaning, transformation, data mining and interpretation/evaluation). So if we start with a dataset of 160 products, we get cluster 0 with 88 products classified as sold, cluster 1 with 26 products classified as unsold, and cluster 2 with 46 fewer products classified as sold. The result of using the K-Means method is grouped into three clusters. To enable Bill Lights Store to implement sales and growth strategies based on products that are selling well.","PeriodicalId":359182,"journal":{"name":"Jurnal SAINTEKOM","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal SAINTEKOM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33020/saintekom.v13i1.402","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The large number of products sold by the Bill Lights Store resulted in a stockpile of several product items due to the large supply of products that were less attractive to customers, resulting in many unsold and under-sold products. Bill Lights struggles with inventory levels of sold and unsold products, as well as shortages and overstocks. Bill Lights stores should rank each product so that they know which products are in the most demand. The purpose of this research is to solve the problem of using inventory information by grouping inventory products based on product characteristics using data mining techniques. The technique used is the K-Means algorithm method. K-Means algorithm clustering method and RapidMiner software processing. The data mining process starts with data processing (selection, cleaning, transformation, data mining and interpretation/evaluation). So if we start with a dataset of 160 products, we get cluster 0 with 88 products classified as sold, cluster 1 with 26 products classified as unsold, and cluster 2 with 46 fewer products classified as sold. The result of using the K-Means method is grouped into three clusters. To enable Bill Lights Store to implement sales and growth strategies based on products that are selling well.
利用聚均值算法执行销售交易
Bill Lights商店销售的大量产品导致了一些产品的库存,因为大量的产品供应对客户的吸引力较小,导致许多产品未售出和销售不足。Bill Lights正在努力应对已售和未售产品的库存水平,以及短缺和库存过剩。Bill Lights商店应该对每种产品进行排名,这样他们就知道哪些产品需求最大。本研究的目的是利用数据挖掘技术,根据产品特征对库存产品进行分组,解决库存信息的使用问题。使用的技术是k -均值算法方法。K-Means算法聚类方法和RapidMiner软件处理。数据挖掘过程从数据处理(选择、清理、转换、数据挖掘和解释/评估)开始。因此,如果我们从包含160种产品的数据集开始,我们得到集群0有88种产品被分类为已售出,集群1有26种产品被分类为未售出,集群2有46种产品被分类为已售出。使用K-Means方法的结果分为三个簇。使Bill Lights商店根据销售良好的产品实施销售和增长战略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信