Published: 2024-08-01

Predicting Consumer Demand Based on Retail Stock Using the K-Nearest Neighbors Algorithm

DOI: 10.35870/ijsecs.v4i2.2865

Anindya Putri N.A, Wahyu Hadikristanto, Edora

Abstract

Inefficient stock management, such as improper stock management, will result in excess or shortage of goods. Excess stock can cause high storage costs and the risk of unsold goods. Predict consumer needs based on stock. Analyze inefficient stock to improve shortages. One effective method for making this prediction is using the K-Nearest Neighbors (K-NN) algorithm. The K-NN algorithm is a simple but powerful machine-learning technique that can be used for classification and regression. The model scenario results show 24 objects in the Low-needs group and 14 in the High-needs group. Evaluation and performance testing using the Rapid Miner tool can also produce a relevant picture of the modelled scenario. The model implemented using the K-NN algorithm has an Accuracy value of 97.50% with a Standard Deviation of +/- 750%, then a Precision value of 100%, and a Recall value of 950%. By measuring model performance with cross-validation, the resulting accuracy has a standard deviation value, which aims to see the distance between the average accuracy and the accuracy of each experiment (iteration)

Keywords

K-NN ; Data Mining ; Retail Stock ; 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 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

Putri N.A, A., Hadikristanto, W., & Edora. (2024). Predicting Consumer Demand Based on Retail Stock Using the K-Nearest Neighbors Algorithm. International Journal Software Engineering and Computer Science (IJSECS), 4(2), 523-534. https://doi.org/10.35870/ijsecs.v4i2.2865
Issue Cover

Downloads

Article Metrics

If the link doesn't work, copy the DOI or article title for manual search (API Maintenance).

Share:
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: August 1, 2024

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.

Semantic Scholar Scite Dimensions Connected Papers
Scholarly Connection Platforms
Dimensions Dimensions Connected Papers Connected Papers Scite Scite Google Scholar Google Scholar Semantic Scholar Semantic Scholar Garuda Garuda Scilit Scilit Crossref Crossref BASE BASE Zenodo Zenodo Unpaywall Unpaywall OpenCitations OpenCitations
Author Biographies
Anindya Putri N.A
Google Scholar ResearchGate ORCID

Informatics Engineering Study Program, Faculty of Engineering, Universitas Pelita Bangsa, Deli Serdang Regency, North Sumatra, Indonesia

Wahyu Hadikristanto
Google Scholar ResearchGate ORCID

Informatics Engineering Study Program, Faculty of Engineering, Universitas Pelita Bangsa, Deli Serdang Regency, North Sumatra, Indonesia

Edora
Google Scholar ResearchGate ORCID

Informatics Engineering Study Program, Faculty of Engineering, Universitas Pelita Bangsa, Deli Serdang Regency, North Sumatra, Indonesia

References
  • Darmi, Y., & Setiawan, A. (2016). Penerapan Metode Clustering K-Means Dalam Pengelompokan Penjualan Produk. Jurnal Media Infotama, Universitas Muhammadiyah Bengkulu, 12(2), 148–157.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Hasanah, H., Larasati, W., & Komputer, F. I. (2019). Pemanfaatan Data Mining Untuk Mengelompokkan. Universitas Duta Bangsa Surakarta, 292–300.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Fahlevi, R. (2020). Penerapan Genetic Modified K-Nearest Neighbor Dalam Klasifikasi Penerima Beras Sejahtera.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Muttaqin, A. G., Auliasari, K., & Wahyuni, F. S. (2020). Penerapan Metode K-Nearest Neighbor Untuk Prediksi Penjualan Berbasis Web Pada PT Wika Industri Energy. Jati (Jurnal Mahasiswa Teknik Informatika), 4(2), 1–6. https://doi.org/10.36040/Jati.V4i2.2728
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Mujilahwati, S., & Windasari, L. D. (2024). Implementasi Metode K-Nearest Neighbor (K-Nn) Untuk Memprediksi Penjualan Buah Di Indonesia Berbasis Website. Seminar Nasional Teknologi Sains, 3(1), 7–14. https://doi.org/10.29407/Stains.V3i1.4077
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Iku, M. H., Mustofa, Y. A., & Kumala, I. S. (2019). Metode K-Nearest Neighbor Untuk Memprediksi Harga Eceran Beras Di Pasar Tradisional Gorontalo. Jurnal Cosphi, 3(2), 50–53.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Hamdani, R. (2020). Pengelompokkan Loyalitas Pelanggan Dengan Menggunakan Kombinasi Rfm Dan Algoritma K-Means. Journal Of Informatic Pelita Nusantara, 5(1), 7-13.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Pramana, I., & Sudiarsa, I. W. (2023). Penerapan Algoritma Naive Bayes Untuk Prediksi Penjualan Produk Terlaris Pada Cv Akusara Jaya Abadi. Jatisi (Jurnal Teknik Informatika), 10(4), 518–534.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • 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
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Febriyanti, A., Bancin, P. V., & Amanda, S. (2022). Penerapan Metode K-Means Clustering Dalam Pengelompokan Data Penjualan Barang Pada PT Swasti Tunggal Mandiri. J-Com (Journal of Computer Science), 2(3), 205–210. https://doi.org/10.33330/J-Com.V2i3.1936
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Sallaby, A. F., Alinse, R. T., Sari, V. N., & Ramadani, T. (2022). Pengelompokan Barang Menggunakan Metode K-Means Clustering Berdasarkan Hasil Penjualan Di Toko Widya Bengkulu. Jurnal Media Infotama, 18(1).
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Fakhriza, M. H., & Umam, K. (2021). Analisis Produk Terlaris Menggunakan Metode K-Means Clustering Pada PT Sukanda Djaya. Jika (Jurnal Informasi dan Komputer Akuntansi), 5(1), 8. https://doi.org/10.31000/Jika.V5i1.3236
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Alfani, W. P. R., Rozi, F., & Sukmana, F. (2021). Prediksi Penjualan Produk Unilever Menggunakan Metode K-Nearest Neighbor. Jipi (Jurnal Ilmiah Penelitian dan Pembelajaran Informatika), 6(1), 155–160. https://doi.org/10.29100/Jipi.V6i1.1910
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Rismala, R., Ali, I., & Rinaldi, A. R. (2023). Penerapan Metode K-Nearest Neighbor Untuk Prediksi Penjualan Sepeda Motor Terlaris. Jati (Jurnal Mahasiswa Teknik Informatika), 7(1), 585–590. https://doi.org/10.36040/Jati.V7i1.6419
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Irfayanti, Y., & Satria, M. I. (2020). Implementasi Metode K-Nearest Neighbor Untuk Prediksi Penjualan Beton Instan Pada PT Decon Multi Industri. Sentinel, 3(2), 288–300. https://doi.org/10.56622/Sentineljournal.V3i2.25
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Saepudin, A., Aryanti, R., Fitriani, E., & Dahlia, D. (2020). Optimasi Algoritma SVM Dan k-NN Berbasis Particle Swarm Optimization Pada Analisis Sentimen Fenomena Tagar# 2019GantiPresiden. Jurnal Khatulistiwa Informatika, 6(1), 95-102.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Assistance, V. D. (2021). Optimasi Parameter K Pada Algoritma K-Nn Untuk Klasifikasi Prioritas Bantuan Pembangunan Desa. Jurnal Teknik Informatika, 20(1), 83–96.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Roni, S., Crysdian, C., & History, A. (2022). Jurnal Teknologi Dan Manajemen Informatika Studi Literature Analisis Potensi Pasar Marketplace Terhadap Penjualan. Jurnal Teknologi dan Manajemen Informatika, 8(2), 134–142.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Imron, M. A. (2020). Peningkatan Akurasi Algoritma K-Nearest Neighbor Menggunakan Normalisasi Z-Score dan Particle Swarm Optimization untuk Prediksi Customer Churn.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
  • Desyanti, D., & Wulandari, D. (2022). Implementasi Algoritma K-Nearest Neighbour Dalam Memprediksi Stok Sepeda Motor. Building Informatics Technology Science, 4(3), 1576–1581. https://doi.org/10.47065/Bits.V4i3.2579.
    Google Scholar Scite Semantic Scholar Scilit Crossref Connected Papers
License & Copyright
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Copyright and Licensing Agreement

Authors who publish with this journal agree to the following terms:

1. Copyright Retention and Open Access License

  • Authors retain full copyright of their work
  • Authors grant the journal 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.

Statistic
OJS View DATA

Similar Articles

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)