Published: 2023-12-30
Classification of Production Machine Spare Part Stock Data Request Needs Using The K-Nearest Neighbor Method
DOI: 10.35870/ijsecs.v3i3.1878
Hamdi Yansyah, Sifa Fauziah, Donny Maulana
- Hamdi Yansyah: Universitas Pelita Bangsa Cikarang
- Sifa Fauziah: Universitas Pelita Bangsa Cikarang
- Donny Maulana: Universitas Pelita Bangsa Cikarang
Article Metrics
- 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
Spare parts encompass various items that are offered, owned, utilized, or consumed to fulfill consumer desires and requirements. This research implements the K-Nearest Neighbor algorithm on a test dataset consisting of 100 data objects, resulting in a novel classification perspective. The study includes a comprehensive model evaluation process involving Cross Validation on both training and testing datasets, comprising 1000 records with 36 critical and 64 non-critical outcomes. Performance assessment and testing utilizing the RapidMiner Studio application yield optimal results under various modeled scenarios. The accuracy of this algorithm model stands at 98.00%, with a standard deviation of +/- 4.00%.
Keywords
Spare Parts; Machinery; Products; Data Mining; K-NN; Classification
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.
Open Science Badges
This journal supports transparency in research and encourages authors to meet criteria for Open Science Badges.
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. 3 No. 3 (2023)
-
Section: Articles
-
Published: 2023-12-30
-
License: CC BY 4.0
-
Copyright: © 2023 Authors
-
DOI: 10.35870/ijsecs.v3i3.1878
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.
Hamdi Yansyah, Universitas Pelita Bangsa Cikarang
Informatics Engineering Study Program, Faculty of Engineering, Universitas Pelita Bangsa Cikarang, Bekasi Regency, West Java Province, Indonesia
Sifa Fauziah, Universitas Pelita Bangsa Cikarang
Informatics Engineering Study Program, Faculty of Engineering, Universitas Pelita Bangsa Cikarang, Bekasi Regency, West Java Province, Indonesia
-
Niar, Y., Komariah, K., Surip, A., Saputra, R. and Ali, I., 2020. Implementasi Algoritma Naïve Bayes Untuk Prediksi Persediaan Barang Rotan. KOPERTIP: Scientific Journal of Informatics Management and Computer, 4(1), pp.28-34. DOI: https://doi.org/10.32485/kopertip.v4i1.112.
-
-
-
Darmi, Y.D. and Setiawan, A., 2016. Penerapan metode clustering k-means dalam pengelompokan penjualan produk. Jurnal Media Infotama, 12(2). DOI: https://doi.org/10.37676/jmi.v12i2.418.
-
Adiana, B.E., Soesanti, I. and Permanasari, A.E., 2018. Analisis segmentasi pelanggan menggunakan kombinasi RFM model dan teknik clustering. Jurnal Terapan Teknologi Informasi, 2(1), pp.23-32. DOI: https://doi.org/10.21460/jutei.2018.21.76.
-
Suyanto, S., Meliana, S., Wahyuningrum, T. and Khomsah, S., 2022. A new nearest neighbor-based framework for diabetes detection. Expert Systems with Applications, 199, p.116857. DOI: https://doi.org/10.1016/j.eswa.2022.116857.
-
-
-
-
Ulya, S., Soeleman, M.A. and Budiman, F., 2021. Optimasi Parameter K Pada Algoritma K-NN Untuk Klasifikasi Prioritas Bantuan Pembangunan Desa. Techno. Com, 20(1), pp.83-96. DOI: https://doi.org/10.33633/tc.v20i1.4215.
-
Liklikwatil, R.D., Noersasongko, E. and Supriyanto, C., 2018. Optimasi K-Nearest Neighbor Dengan Particle Swarm Optimization Untuk Memprediksi Harga Komoditi Karet. E-JURNAL JUSITI: Jurnal Sistem Informasi dan Teknologi Informasi, 7(2), pp.172-182. DOI https://doi.org/10.36774/jusiti.v7i2.252.
-
Miftahuddin, Y., Umaroh, S. and Dwiutama, A.A., 2020. Identifikasi Jenis Font Menggunakan Metode Genetic Modified K-Nearest Neighbor. Rekayasa Hijau: Jurnal Teknologi Ramah Lingkungan, 4(3), pp.157-166. DOI: https://doi.org/10.26760/jrh.v4i3.157-166.
-
-
-
-
-
-
-
-
Hutabarat, S.M. and Sindar, A., 2019. Data Mining Penjualan Suku Cadang Sepeda Motor Menggunakan Algoritma K-Means. Jurnal Nasional Komputasi dan Teknologi Informasi (JNKTI), 2(2), pp.126-132. DOI: https://doi.org/10.32672/jnkti.v2i2.1555

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.