Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 2

K-Means Retail Product Sales Clustering via Elbow and Davies-Bouldin

IJCCS (Indonesian Journal of Computing and Cybernetics Systems) · Vol. 20 No. 4 (2026)

DOI
10.22146/ijccs.125921
ISSN
2460-7258, 1978-1520
Terbit
2026-10-31
Penerbit
IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

The expansion of the retail business requires business operators to accurately group best-selling and slow-moving products in order to optimize inventory adjustment strategies. This study aims to cluster sales transaction data and determine the optimal number of clusters using the K-Means algorithm. A secondary dataset consisting of 7,373 transaction records was analyzed based on the attributes of transaction count and total sales. The best cluster number was determined using the Elbow method based on the Sum of Squared Errors and validated using the Davies-Bouldin Index. The test results show that both methods consistently produced an optimal number of clusters, k, equal to 4, with a Davies-Bouldin Index value of 0.47. This value indicates a very well-separated cluster structure. The final clustering resulted in four product performance categories: 2 “best-selling” products, 20 “selling well” products, 171 “moderately selling” products, and 7,180 “poorly selling” products. This evaluation demonstrates that the combination of K-Means, the Elbow method, and the Davies-Bouldin Index effectively provides data-driven insights to support inventory management decision-making in the retail business.

Kata kunci

Jaringan kolaborasi para penulis

Belum ada rekan penulis di Melola.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.ugm.ac.id/ijccs/oai, pertama di-harvest 1 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">K-Means Retail Product Sales Clustering via Elbow and Davies-Bouldin</dc:title>
	<dc:creator>Wardani, Ni Wayan</dc:creator>
	<dc:subject xml:lang="en-US">Data Mining</dc:subject>
	<dc:subject xml:lang="en-US">Clustering, K-Means, Elbow Method, Davies-Bouldin Index</dc:subject>
	<dc:description xml:lang="en-US"> The expansion of the retail business requires business operators to accurately group best-selling and slow-moving products in order to optimize inventory adjustment strategies. This study aims to cluster sales transaction data and determine the optimal number of clusters using the K-Means algorithm. A secondary dataset consisting of 7,373 transaction records was analyzed based on the attributes of transaction count and total sales. The best cluster number was determined using the Elbow method based on the Sum of Squared Errors and validated using the Davies-Bouldin Index. The test results show that both methods consistently produced an optimal number of clusters, k, equal to 4, with a Davies-Bouldin Index value of 0.47. This value indicates a very well-separated cluster structure. The final clustering resulted in four product performance categories: 2 “best-selling” products, 20 “selling well” products, 171 “moderately selling” products, and 7,180 “poorly selling” products. This evaluation demonstrates that the combination of K-Means, the Elbow method, and the Davies-Bouldin Index effectively provides data-driven insights to support inventory management decision-making in the retail business.</dc:description>
	<dc:publisher xml:lang="en-US">IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2026-10-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.ugm.ac.id/ijccs/article/view/125921</dc:identifier>
	<dc:identifier>10.22146/ijccs.125921</dc:identifier>
	<dc:source xml:lang="en-US">IJCCS (Indonesian Journal of Computing and Cybernetics Systems); Vol 20, No 4 (2026): October</dc:source>
	<dc:source>2460-7258</dc:source>
	<dc:source>1978-1520</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.ugm.ac.id/ijccs/article/view/125921/45926</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2026 IJCCS (Indonesian Journal of Computing and Cybernetics Systems)</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>