Implementasi Data Mining K-Means Clustering Untuk Pengelompokan Produk Keramik Berdasarkan Frekuensi, Volume, dan Jangkauan Penjualan


Authors

  • Ferdian Arya Dinata Universitas Islam Negeri Sultan Syarif Kasim Riau, Pekanbaru, Indonesia
  • Alwis Nazir Universitas Islam Negeri Sultan Syarif Kasim Riau, Pekanbaru, Indonesia
  • Fadhilah Syafria Universitas Islam Negeri Sultan Syarif Kasim Riau, Pekanbaru, Indonesia
  • Teddie Darmizal Universitas Islam Negeri Sultan Syarif Kasim Riau, Pekanbaru, Indonesia
  • Eka Pandu Cynthia Universitas Islam Negeri Sultan Syarif Kasim Riau, Pekanbaru, Indonesia

DOI:

https://doi.org/10.47065/bulletincsr.v6i4.1195

Keywords:

K-Means Clustering; Data Mining; FMR; Davies-Bouldin Index; Ceramic Sales

Abstract

Ceramic inventory management at CV. Makmur Bersama has generally relied on intuition or partial sales data, without accounting for purchasing behavior patterns as a whole. This approach simultaneously creates two major risks: overstocking of slow-moving products, which burdens working capital and storage space, and stockouts of high-demand products, which can result in lost sales opportunities. This problem is further compounded by the limitation of stock data, which typically contains only a single quantitative variable such as the number of units sold and is therefore unable to comprehensively capture product demand characteristics, such as how frequently a product is purchased or how broad its customer base is. As a result, restocking decisions and promotional strategies are often poorly targeted. This research applies the K-Means algorithm to cluster ceramic products based on historical sales patterns as a solution to this limitation. Historical sales data from CV. Makmur Bersama for the 2025 period, consisting of 6,328 transactions, was processed into 417 unique products through a feature engineering approach using Frequency, Monetary, and Reach (FMR) namely transaction count, total quantity sold, and unique customer count per product. After outlier detection using the Interquartile Range (IQR) method, 381 products remained for the clustering process. The optimal number of clusters was determined using the Elbow Method, resulting in k=4 as the best cluster count. Evaluation using the Davies-Bouldin Index (DBI) produced a value of 0.8954, categorized as good, and stability testing across five iterations with different random states showed consistent results (DBI standard deviation of 0.0034). The clustering results produced Cluster 1 (190 products, 49.9%) as slow-moving products, Cluster 2 (34 products, 8.9%) as top-performing products with an average transaction frequency of 30.8 times, Cluster 3 (93 products, 24.4%) as potential products, and Cluster 4 (64 products, 16.8%) as products with limited demand. This research provides practical contributions for companies in determining restocking priorities, promotional strategies, and working capital efficiency based on actual sales patterns. This research contributes methodologically through the adaptation of the RFM framework into FMR to better suit real-world data constraints, as well as the integration of the Elbow Method, Davies-Bouldin Index, and stability testing as a comprehensive validation mechanism. Practically, the segmentation results can be directly utilized by the company as a basis for restocking priorities, promotional strategies, and working capital allocation efficiency based on actual sales patterns.

Downloads

Download data is not yet available.

References

C. Purnama, W. Witanti, and P. Nurul Sabrina, “Klasterisasi Penjualan Pakaian untuk Meningkatkan Strategi Penjualan Barang Menggunakan K-Means,” Journal of Information Technology, vol. 4, no. 1, pp. 35–38, Mar. 2022, doi: 10.47292/joint.v4i1.79.

D. Handoko, H. S. Tambunan, and J. T. Hardinata, “Analisis Penjualan Produk Paket Kuota Internet Dengan Metode K-Nearest Neighbor,” Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika), vol. 6, no. 1, p. 111, Feb. 2021, doi: 10.30645/jurasik.v6i1.275.

Y. Yuliana, M. Richie, and H. Agung, “Implementasi Algoritma K-Means Untuk Pemilihan Keramik Dan Pelanggan Potensial Pada Cv. Jaya Tunggal Keramik,” Jurnal Algoritma, Logika dan Komputasi, vol. 3, no. 2, Dec. 2020, doi: 10.30813/j-alu.v3i2.2157.

W. W. Kristianto, “Penerapan Data Mining Pada Penjualan Produk Menggunakan Metode K-Means Clustering (Studi Kasus Toko Sepatu Kakikaki),” Jurnal Pendidikan Teknologi Informasi (JUKANTI), vol. 5, no. 2, pp. 90–98, Nov. 2022, doi: 10.37792/jukanti.v5i2.547.

J. Jupriyanto and S. Nurlela, “Kerangka Pengambilan Keputusan Untuk Pemasaran Presisi Menggunakan Metode Rfm, Algoritma K-Means Dan Decision Tree,” Jurnal Pilar Nusa Mandiri, vol. 15, no. 2, pp. 227–234, Sep. 2019, doi: 10.33480/pilar.v15i2.618.

I. S. Mangku Negara, P. Purwono, and I. A. Ashari, “Analisa Cluster Data Transaksi Penjualan Minimarket Selama Pandemi Covid-19 dengan Algoritma K-means,” JOINTECS (Journal of Information Technology and Computer Science), vol. 6, no. 3, p. 153, Sep. 2021, doi: 10.31328/jointecs.v6i3.2693.

S. Aulia, “Klasterisasi Pola Penjualan Pestisida Menggunakan Metode K-Means Clustering (Studi Kasus Di Toko Juanda Tani Kecamatan Hutabayu Raja),” Djtechno: Jurnal Teknologi Informasi, vol. 1, no. 1, pp. 1–5, Jun. 2021, doi: 10.46576/djtechno.v1i1.964.

A. Muni, “Analisis Algoritma K-Means Clustering Untuk Menentukan Strategi Promosi Penjualan Sepeda Motor Studi Kasus PT. Alfa Scorpii,” JUTI UNISI, vol. 4, no. 1, pp. 1–8, Jul. 2020, doi: 10.32520/juti.v4i1.1087.

S. Butsianto and N. T. Mayangwulan, “Penerapan Data Mining Untuk Prediksi Penjualan Mobil Menggunakan Metode K-Means Clustering,” Jurnal Nasional Komputasi dan Teknologi Informasi (JNKTI), vol. 3, no. 3, pp. 187–201, Dec. 2020, doi: 10.32672/jnkti.v3i3.2428.

R. S. Wicaksana, D. Heksaputra, T. A. Syah, and F. F. Nur’aini, “Pendekatan K-Means Clustering Metode Elbow Pada Analisis Motivasi Pengunjung Festival Halal JHF#2,” Jurnal Ilmiah Ekonomi Islam, vol. 9, no. 3, p. 4162, Nov. 2023, doi: 10.29040/jiei.v9i3.10591.

F. Hadi and Y. Diana, “Pengklusteran Penjualan Bahan Bangunan Menggunakan Algoritma K-Means,” JOISIE (Journal Of Information Systems And Informatics Engineering), vol. 4, no. 1, p. 22, Jun. 2020, doi: 10.35145/joisie.v4i1.629.

F. Indriyani and E. Irfiani, “Clustering Data Penjualan pada Toko Perlengkapan Outdoor Menggunakan Metode K-Means,” JUITA?: Jurnal Informatika, vol. 7, no. 2, p. 109, Nov. 2019, doi: 10.30595/juita.v7i2.5529.

F. Nurdiyansyah and I. Akbar, “Implementasi Algoritma K-Means untuk Menentukan Persediaan Barang pada Poultry Shop,” Jurnal Teknologi dan Manajemen Informatika, vol. 7, no. 2, pp. 86–94, Dec. 2021, doi: 10.26905/jtmi.v7i2.6377.

A. Wahid, A. Nazir, S. K. Gusti, - Yusra, and F. Syafria, “Pengelompokkan Keberhasilan Produksi Peternak Ayam Broiler di Riau Berdasarkan Index Performance Menggunakan K-Means,” Techno.Com, vol. 22, no. 1, pp. 176–185, Feb. 2023, doi: 10.33633/tc.v22i1.7282.

A. Alvin Anzaz Islami, E. Haerani, Novriyanto, and A. Nazir, “Pengelompokan pembagian zakat dengan menggunakan metode clustering k-means,” Jurnal CoSciTech (Computer Science and Information Technology), vol. 4, no. 1, pp. 154–163, Apr. 2023, doi: 10.37859/coscitech.v4i1.4804.

A. Ahyuna, M. Lasena, R. Aminuddin, A. Ardimansyah, and Z. Azhar, “Pembentukan Pola Peminjaman Buku Pada Perpustakaan Dengan Menerapkan Metode CART dan Normalisasi Z-Score,” Building of Informatics, Technology and Science (BITS), vol. 6, no. 1, pp. 314–324, Jun. 2024, doi: 10.47065/bits.v6i1.5238.

I. D. Iskandar and I. Zufria, “Clustering Pasien Rawat Inap Di RS USU Menggunakan Algoritma K-Means,” Journal of Computer Science and Informatics Engineering, pp. 54–63, May 2024, doi: 10.55537/cosie.v3i2.768.

A. W. Aranski, S. Astiti, R. A. Putra, and D. Darmansah, “Pengaplikasian Data Mining Dalam Mengelompokan Data Penerima Bantuan Subsidi Rumah dengan Menggunakan Metode K-Means Clustering,” Building of Informatics, Technology and Science (BITS), vol. 6, no. 1, pp. 480–489, Jun. 2024, doi: 10.47065/bits.v6i1.5366.

Khoirul Muhammad Habib, Miftahus Sholihin, and Agus Setia Budi, “Penerapan Algoritma K Means Clustering Hasil Tangkap Ikan Di Pelabuhan Brondong,” Jurnal Publikasi Ilmu Komputer dan Multimedia, vol. 5, no. 1, pp. 117–126, Jan. 2026, doi: 10.55606/jupikom.v5i1.5352.

Jiawei. Han, Micheline. Kamber, and Jian. Pei, Data mining?: concepts and techniques. Elsevier/Morgan Kaufmann, 2012.


Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Implementasi Data Mining K-Means Clustering Untuk Pengelompokan Produk Keramik Berdasarkan Frekuensi, Volume, dan Jangkauan Penjualan

Dimensions Badge

ARTICLE HISTORY

Published: 2026-06-30

Abstract View: 22 times
PDF Download: 6 times

How to Cite

Dinata, F. A., Nazir, A., Syafria, F., Darmizal, T., & Cynthia, E. P. (2026). Implementasi Data Mining K-Means Clustering Untuk Pengelompokan Produk Keramik Berdasarkan Frekuensi, Volume, dan Jangkauan Penjualan. Bulletin of Computer Science Research, 6(4), 1533-1543. https://doi.org/10.47065/bulletincsr.v6i4.1195

Issue

Section

Articles

Most read articles by the same author(s)