Analisis Clustering Pengelompokan Penjualan Paket Data Menggunakan Metode K-Means

Dimas Galang Ramadhan, Indriati Prihatini, Febri Liantoni
{"title":"Analisis Clustering Pengelompokan Penjualan Paket Data Menggunakan Metode K-Means","authors":"Dimas Galang Ramadhan, Indriati Prihatini, Febri Liantoni","doi":"10.31937/ti.v13i1.1981","DOIUrl":null,"url":null,"abstract":"At present with the COVID-19 pandemic situation that requires all activities based in the network, starting from work, college, school, everything is based on the network. Certain provider users will experience excessive data plan usage. This also has an effect on a counter that sells data packages, which must provide several data package services in accordance with current conditions. This research was conducted to analyze the grouping of sales of data packages that are often purchased by customers in a counter by using the K-Means method. The K-Means method is used because the K-Means algorithm is not influenced by the order of the objects used, this is proven when the writer tries to determine the initial cluster center randomly from one of the objects in the first calculation. sales of data packages at a counter. Variables used include Price, Active period, and number of data packages. The K-Means Cluster Analysis algorithm is basically applied to the problem of understanding consumer needs, identifying the types of data package products that are often purchased. The K-Means algorithm can be used to describe the characteristics of each group by summarizing a large number of objects so that it is easier.","PeriodicalId":347196,"journal":{"name":"Ultimatics : Jurnal Teknik Informatika","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ultimatics : Jurnal Teknik Informatika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31937/ti.v13i1.1981","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

At present with the COVID-19 pandemic situation that requires all activities based in the network, starting from work, college, school, everything is based on the network. Certain provider users will experience excessive data plan usage. This also has an effect on a counter that sells data packages, which must provide several data package services in accordance with current conditions. This research was conducted to analyze the grouping of sales of data packages that are often purchased by customers in a counter by using the K-Means method. The K-Means method is used because the K-Means algorithm is not influenced by the order of the objects used, this is proven when the writer tries to determine the initial cluster center randomly from one of the objects in the first calculation. sales of data packages at a counter. Variables used include Price, Active period, and number of data packages. The K-Means Cluster Analysis algorithm is basically applied to the problem of understanding consumer needs, identifying the types of data package products that are often purchased. The K-Means algorithm can be used to describe the characteristics of each group by summarizing a large number of objects so that it is easier.
使用k -意义方法对数据包销售集群分析
当前新冠疫情要求所有活动都以网络为基础,从工作、大学、学校开始,一切都以网络为基础。某些提供商用户将遇到过多的数据计划使用。这对销售数据包的计数器也有影响,它必须根据当前情况提供几种数据包服务。本研究使用K-Means方法分析顾客在柜台经常购买的数据包的销售分组。使用K-Means方法是因为K-Means算法不受所用对象顺序的影响,当作者试图在第一次计算中从一个对象随机确定初始聚类中心时证明了这一点。在柜台销售数据包。使用的变量包括价格、活动期和数据包数量。K-Means聚类分析算法基本上应用于了解消费者需求的问题,识别经常购买的数据包产品的类型。K-Means算法可以通过汇总大量的对象来描述每一组的特征,这样比较容易。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信