K-Means Clustering of Product Sales Patterns for Inventory Management at Fahra Jaya Store
DOI:
https://doi.org/10.30998/faktorexacta.v19i3.4905Keywords:
Clustering, Data mining, Inventory management, K-Means, Sales patternsAbstract
Sales transaction data play a crucial role in supporting business decision-making. However, in many grocery stores, including the Fahra Jaya Store, transaction data are often simply stored without further analysis, resulting in inventory management that relies heavily on the owner’s judgment. This study applied K-Means clustering to group products based on sales patterns and develop inventory recommendations. Sales transaction data from January through October 2025 at the Fahra Jaya Store were collected and preprocessed, resulting in 1,003 valid product records. The clustering process used three variables: number of units sold, average sales, and sales growth, yielding three distinct clusters. Cluster 0 (31 products) exhibited high sales and moderate growth; Cluster 1 (93 products) showed the highest growth from a low sales base; and Cluster 2 (879 products) represented low sales and growth. The Davies-Bouldin Index (DBI) yielded a value of 0.638. The choice of k = 3 was examined by comparing it against k = 2 through 6 using the Elbow method, DBI, and cluster size balance. Although the lowest DBI occurred at k = 4 (0.494), it resulted from a cluster containing only a single product; therefore, k = 3 was retained. The clustering results were interpreted to formulate specific recommendations: maintaining stock for high-sales products (Cluster 0), increasing stock gradually for products with rising demand (Cluster 1), and evaluating low-sales products individually before reducing stock (Cluster 2).
Downloads
References
[1] D. Laras Wati, V. Septianingsih, W. Khoeruddin, and Z. Quraish Al-Qorni, “Peranan UMKM (Usaha Mikro, Kecil dan Menengah) dalam Meningkatkan Perekonomian Indonesia,” Jurnal Ekonomi Bisnis, Manajemen dan Akuntansi (JEBMAK), vol. 3, no. 1, pp. 265–282, Jun. 2024, doi: https://doi.org/10.61930/jebmak.v3i1.576.
[2] Faisol, A. Wahyudin, and M. Djasuli, “Potret Pengetahuan Pelaku UMKM Toko Kelontong Madura dalam Penyusunan Laporan Keuangan,” Jurnal Neraca: Jurnal Pendidikan dan Ilmu Ekonomi Akuntansi, vol. 9, no. 2, pp. 192–207, Dec. 2025, doi: 10.31851/n8wxxa94.
[3] N. N. Hasan, F. Maulana, A. P. Wiguna, and O. I. Khair, “Pemanfaatan Teknologi Informasi untuk Efisiensi Operasional UMKM,” Jurnal Sains, Ekonomi, Manajemen, Akuntansi dan Hukum, vol. 2, no. 4, pp. 285–291, Jul. 2025, doi: https://doi.org/10.60126/sainmikum.v2i4.1094.
[4] Kasini and N. Hidayati, “Penerapan Data Mining untuk Clustering pada Toko Laura Grosir dan Eceran Menggunakan Algoritma K-Means,” JUSTER: Jurnal Sains dan Terapan, vol. 2, no. 3, pp. 51–60, Dec. 2023, doi: https://doi.org/10.57218/juster.v2i3.990.
[5] Arys Purwanto, “Fahra Jaya Store Interview and Observation Report,” Tegal, Jan. 2026.
[6] N. A. Mustafa, R. Susetyoko, A. Fadliana, and F. M. Humaira, “Implementasi Algoritma Apriori dalam Penetapan Strategi Penjualan pada Supermarket XYZ Berbasis Streamlit Web App,” Jurnal Infomedia : Teknik Informatika, Multimedia, dan Jaringan, vol. 10, no. 1, pp. 69–78, Jun. 2025, Accessed: Aug. 12, 2026. [Online]. Available: https://e-jurnal.pnl.ac.id/infomedia/article/view/6893
[7] A. P. Rizkyandri, Jasmir, and Y. Arvita, “Implementasi Metode K-Means Clustering untuk Menentukan Persediaan Barang pada Toko SS BabyShop,” Jurnal Informatika Dan Rekayasa Komputer (JAKAKOM), vol. 3, no. 2, pp. 712–718, Sep. 2023, doi: https://doi.org/10.33998/jakakom.v3i2.
[8] P. W. Rahayu et al., Buku Ajar Data Mining, 1st ed. Bojonegoro: Sonpedia Publishing Indonesia, 2024. [Online]. Available: www.buku.sonpedia.com
[9] A. Yahya and R. Kurniawan, “Implementation of K-Means Algorithm for Clustering Sales Data Based on Sales Patterns,” MALCOM: Indonesian Journal of Machine Learning and Computer Science, vol. 5, no. 1, pp. 350–358, Jan. 2025, doi: 10.57152/malcom.v5i1.1773.
[10] A. Damayanti and R. A. Putri, “Penerapan Algoritma K-Means Clustering dalam Pola Penjualan Beras,” Journal of Computer System and Informatics (JoSYC), vol. 5, no. 4, pp. 903–911, Aug. 2024, doi: 10.47065/josyc.v5i4.5734.
[11] N. Salsabila, Tukino, A. Hananto, and B. Priyatna, “Algoritma K-Means Clustering untuk Segmentasi Produk Kosmetik Terlaris Berdasarkan Volume Penjualan,” EXPERT: Jurnal Manajemen Sistem Informasi dan Teknologi, vol. 15, no. 1, pp. 42–49, Jun. 2025, doi: http://dx.doi.org/10.36448/expert.v15i1.4318.
[12] A. R. N. Simamora, T. Taufik, and S. Nurulita, “Pengaruh Pertumbuhan Penjualan, Leverage, Ukuran Perusahaan, Efisiensi Operasional, dan Konservatisme Akuntansi terhadap Kinerja Keuangan,” JAKP (Jurnal Akuntansi, Keuangan dan Perpajakan), vol. 8, no. 2, pp. 216–228, Aug. 2025, doi: 10.51510/jakp.v8i2.2469.
[13] P. A. K. Dewi and H. Rahyuda, “The Impact of Profitability, Liquidity, Firm Size, and Sales Growth on Firm Value in the Food and Beverage Subsector,” American Journal of Humanities and Social Sciences Research (AJHSSR), vol. 9, no. 5, pp. 328–337, May 2025, [Online]. Available: www.ajhssr.com
[14] J. K. Wororomi et al., Data Mining (Memahami Pola di Balik Angka), 1st ed. Purbalingga: Eureka Media Aksara, 2024. Accessed: Aug. 12, 2026. [Online]. Available: https://repository.penerbiteureka.com/publications/571395/
[15] R. Fajri, Iqbal, Sriwinar, I. Zulkarnain, F. Rizani, and H. Gustami, Statistika Deskriptif & Probabilitas, 1st ed. Bireuen: Madza, 2024.
[16] N. N. Afidah and Masrukan, “Penerapan Metode Clustering dengan Algoritma K-means untuk Pengelompokkan Data Migrasi Penduduk Tiap Kecamatan di Kabupaten Rembang,” PRISMA (Prosiding Seminar Nasional Matematika), vol. 6, pp. 729–738, 2023, [Online]. Available: https://journal.unnes.ac.id/sju/index.php/prisma/.
[17] V. Alvianatinova, I. Ali, N. Rahaningsih, and A. Bahtiar, “Penerapan Algoritma K-Means Clustering dalam Pengelompokan Data Penjualan Supermarket berdasarkan Cabang (Branch),” JATI (Jurnal Mahasiswa Teknik Informatika), vol. 8, no. 2, pp. 1529–1535, Apr. 2024, doi: https://doi.org/10.36040/jati.v8i2.8993.
[18] A. Jasinska-Piadlo et al., “Data-driven versus a domain-led approach to k-means clustering on an open heart failure dataset,” Int. J. Data Sci. Anal., vol. 15, pp. 49–66, Jul. 2022, doi: 10.1007/s41060-022-00346-9.
[19] G. Pasya Dermawan Sinukaban and Al-Khowarizmi, “Clustering of Crime-Prone Areas in East Medan Based on Police Data Using K-Means and DBSCAN Algorithms,” Ilmu Komputer Informatika, vol. 10, no. 1, pp. 91–102, Apr. 2026, doi: 10.30829/algoritma.v10i1.29498.
[20] D. H. Bangkalang, N. Setiyawati, and H. D. Purnomo, “Comparison between K-Means and K-Means++ Clustering Models Using Singular Value Decomposition (SVD) in Menu Engineering,” International Journal on Informatics Visualization, vol. 7, no. 3, pp. 871–877, Sep. 2023, doi: http://dx.doi.org/10.30630/joiv.7.3.1053.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Ihfan Nur Maulana, Rito Cipta Sigitta, Andika Chandra Prasetyo (Author)

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Under the CC BY-NC 4.0 License, users are permitted to:
-
Share: Copy, distribute, and transmit the material across any medium or format.
-
Adapt: Remix, transform, and build upon the work for non-commercial purposes.
These permissions are granted provided the following conditions are met:
-
Attribution (BY): Proper credit must be given to the original author(s) and Faktor Exacta, including a direct link to the license and a clear indication of any modifications made. This acknowledgment must not imply endorsement by the journal or the authors. Reusers are required to include the article’s Digital Object Identifier (DOI) for permanent citation reference.
-
NonCommercial (NC): The material may not be exploited for commercial purposes or monetary gain. Any commercial utilization, republication, or integration into commercial goods requires explicit, prior written permission from the copyright holder(s).
-
No Additional Restrictions: No legal provisions or technological protection measures (such as DRM) may be applied to restrict others from exercising the freedoms granted by this license.
Official Legal Code: For the full and legally binding terms, please review the official Creative Commons Attribution-NonCommercial 4.0 International Public License.

