Published: 2024-08-01
Grouping Production Goods Requirements Using the K-Means Clustering Method
DOI: 10.35870/ijsecs.v4i2.2863
Dani Yuda Dwi Setiawan, Wahyu Hadikristanto, Edora
Article Metrics
- Views 0
- Downloads 0
- Scopus Citations
- Google Scholar
- Crossref Citations
- Semantic Scholar
- DataCite Metrics
-
If the link doesn't work, copy the DOI or article title for manual search (API Maintenance).
Abstract
The inventory management of production goods presents several challenges, including difficulties in distinguishing between necessary and unnecessary items, leading to overstocking and manual data processing issues. Additionally, the risk of data loss can impede the data processing workflow. Data testing is conducted to evaluate the accuracy of calculations and the functionality of the applied methods. The objective is to optimize production results and inventory levels in warehouses. The K-means algorithm, known for its simplicity and effectiveness, is utilized to identify clusters within the data. The first cluster (C0) has centroids at (60.33, 70.33) and includes stock data categorized as having no potential. This cluster comprises 35 records. The second cluster (C1) has centroids at (10.94, 7.11) and includes stock data categorized as available, consisting of 15 records. Testing with the RapidMiner Studio application confirms similar insights, with each cluster containing members that are divided into two clusters, each having optimal centroid values of (60.33, 70.33) for Cluster 1 (C0) and (10.94, 7.14) for Cluster 2 (C1), and a Davies-Bouldin Index evaluation score of 0.666.
Keywords
Data Mining ; Stock Requirements ; Production Results ; Clustering ; K-Means
Article Metadata
Peer Review Process
This article has undergone a double-blind peer review process to ensure quality and impartiality.
Indexing Information
Discover where this journal is indexed at our indexing page to understand its reach and credibility.
Open Science Badges
This journal supports transparency in research and encourages authors to meet criteria for Open Science Badges by sharing data, materials, or preregistered studies.
How to Cite
Article Information
This article has been peer-reviewed and published in the International Journal Software Engineering and Computer Science (IJSECS). The content is available under the terms of the Creative Commons Attribution 4.0 International License.
-
Issue: Vol. 4 No. 2 (2024)
-
Section: Articles
-
Published: %750 %e, %2024
-
License: CC BY 4.0
-
Copyright: © 2024 Authors
-
DOI: 10.35870/ijsecs.v4i2.2863
AI Research Hub
This article is indexed and available through various AI-powered research tools and citation platforms. Our AI Research Hub ensures that scholarly work is discoverable, accessible, and easily integrated into the global research ecosystem. By leveraging artificial intelligence for indexing, recommendation, and citation analysis, we enhance the visibility and impact of published research.
Dani Yuda Dwi Setiawan
Informatics Engineering Study Program, Faculty of Engineering, Universitas Pelita Bangsa, Deli Serdang Regency, North Sumatra, Indonesia
Wahyu Hadikristanto
Informatics Engineering Study Program, Faculty of Engineering, Universitas Pelita Bangsa, Deli Serdang Regency, North Sumatra, Indonesia
-
Ramdhan, D., Dwilestari, G., Dana, R. D., Ajiz, A., & Kaslani, K. (2022). Clustering data persediaan barang dengan menggunakan metode K-Means. Means (Media Informasi Analisis dan Sistem), 7(1), 1–9. https://doi.org/10.54367/Means.V7i1.1826
-
-
-
-
-
-
-
Afiasari, N., Suarna, N., & Rahaningsi, N. (2023). Implementasi data mining transaksi penjualan menggunakan algoritma clustering dengan metode K-Means. Jurnal Saintekom, 13(1), 100–110. https://doi.org/10.33020/Saintekom.V13i1.402
-
Al Rasyid, H., Soebari, B. F. K., & Kartika, D. S. Y. (2022). Implementasi algoritma K-Means clustering untuk pengelompokan penjualan produk pada online shop Toko Gizi. Prosiding Seminar Nasional Teknologi dan Sistem Informasi, 2(1), 242–248. https://doi.org/10.33005/Sitasi.V2i1.304
-
-
Fakhriza, M. H., & Umam, K. (2021). Analisis produk terlaris menggunakan metode K-Means clustering pada PT. Sukanda Djaya. Jurnal Informasi, 5(1), 8. https://doi.org/10.31000/Jika.V5i1.3236
-
-
-
-
-
-
-
Jabbar, J. (2022). Sistem informasi stok barang menggunakan metode clustering K-Means (studi kasus RMD Store). Infotech Journal, 8(1), 70–75. https://doi.org/10.31949/Infotech.V8i1.2280
-
-
-
-
-
Prastiwi, H., Pricilia, J., & Rasywir, E. (2022). Implementasi data mining untuk menentukan persediaan stok barang di mini market menggunakan metode K-Means clustering. Jurnal Informasi dan Rekayasa Komputer (JAKAKOM), 2(1), 141–148. https://doi.org/10.33998/Jakakom.2022.2.1.34
-
-
-
Berliana, T. I., Budianita, E., Nazir, A., & Insani, F. (2023). Clustering data persediaan barang menggunakan metode elbow dan DBSCAN. Jurnal Sistem Komputer dan Informasi, 267(2), 258–267. https://doi.org/10.30865/Json.V5i2.7089
-
Indriani, D., Irawan, B., & Bahtiar, A. (2024). Penerapan algoritma K-Means clustering untuk menentukan persediaan stok barang. Jati (Jurnal Mahasiswa Teknik Informasi), 8(1), 182–187. https://doi.org/10.36040/Jati.V8i1.8322
-
Zafira, F., Irawan, B., & Bahtiar, A. (2024). Penerapan data mining untuk estimasi stok barang dengan metode K-Means clustering. Jati (Jurnal Mahasiswa Teknik Informasi), 8(1), 156–161. https://doi.org/10.36040/Jati.V8i1.8319.

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Authors who publish with this journal agree to the following terms:
1. Copyright Retention and Open Access License
Authors retain copyright of their work and grant the journal non-exclusive right of first publication under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
This license allows unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
2. Rights Granted Under CC BY 4.0
Under this license, readers are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material for any purpose, including commercial use
- No additional restrictions — the licensor cannot revoke these freedoms as long as license terms are followed
3. Attribution Requirements
All uses must include:
- Proper citation of the original work
- Link to the Creative Commons license
- Indication if changes were made to the original work
- No suggestion that the licensor endorses the user or their use
4. Additional Distribution Rights
Authors may:
- Deposit the published version in institutional repositories
- Share through academic social networks
- Include in books, monographs, or other publications
- Post on personal or institutional websites
Requirement: All additional distributions must maintain the CC BY 4.0 license and proper attribution.
5. Self-Archiving and Pre-Print Sharing
Authors are encouraged to:
- Share pre-prints and post-prints online
- Deposit in subject-specific repositories (e.g., arXiv, bioRxiv)
- Engage in scholarly communication throughout the publication process
6. Open Access Commitment
This journal provides immediate open access to all content, supporting the global exchange of knowledge without financial, legal, or technical barriers.