Implementation of K-Means Clustering Algorithm to Determine the Best-Selling Snack In Purwokerto MSMES

This research was conducted to provide information related to the sale of existing MSME snacks, which products have many buyers and which are not, besides that this research can provide a view for the sale of various snacks whether they are still sold or selling the same snacks but with new innovations so that there are many enthusiasts. To do this, a grouping is needed, therefore the researcher chooses a k-means algorithm which will later be used for the clustering process. The grouping is divided into two, namely best-selling and under-selling products, for research data collected from January to March 2024. Then the data used includes the name of the snack, the number of stocks and the number of sales. After calculating the results of this study, the k-means algorithm performs a calculation of as many as two rounds so as to form two clusters where in cluster one the names of snacks that sell well are grouped such as cimol, noodle skewers, dimsum, egg rolls and white bread. Then in cluster two, the less selling product falls to seblak snacks so that seblak snacks can make new innovations to sell better and can compete with other products. This research succeeded in grouping and providing an overview of products that sell well or not, for future research can be reproduced related to the data used.

Authors

Institutions

Publication Details

Journal
Building of Informatics Technology and Science (BITS)
Published
2024-09-09
DOI
https://doi.org/10.47065/bits.v6i2.5524
Primary Topic
Customer churn and segmentation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Implementation of K-Means Clustering Algorithm to Determine the Best-Selling Snack In Purwokerto MSMES

Berlilana Berlilana, Ratih Ayuni
Building of Informatics Technology and Science (BITS)
Customer churn and segmentation
article

Implementation of K-Means Clustering Algorithm to Determine the Best-Selling Snack In Purwokerto MSMES

Berlilana Berlilana, Ratih Ayuni
article en

Abstract

This research was conducted to provide information related to the sale of existing MSME snacks, which products have many buyers and which are not, besides that this research can provide a view for the sale of various snacks whether they are still sold or selling the same snacks but with new innovations so that there are many enthusiasts. To do this, a grouping is needed, therefore the researcher chooses a k-means algorithm which will later be used for the clustering process. The grouping is divided into two, namely best-selling and under-selling products, for research data collected from January to March 2024. Then the data used includes the name of the snack, the number of stocks and the number of sales. After calculating the results of this study, the k-means algorithm performs a calculation of as many as two rounds so as to form two clusters where in cluster one the names of snacks that sell well are grouped such as cimol, noodle skewers, dimsum, egg rolls and white bread. Then in cluster two, the less selling product falls to seblak snacks so that seblak snacks can make new innovations to sell better and can compete with other products. This research succeeded in grouping and providing an overview of products that sell well or not, for future research can be reproduced related to the data used.

Building of Informatics Technology and Science (BITS)Vol. 6(2)
Universitas Wijayakusuma Purwokerto (ID)
Openalex Percentile: Top 58%
Customer churn and segmentation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.