Pengelompokan Data Penjualan Produk Cetakan Pada Algoritma K-Means Dengan Bantuan Tool Orange

  • Susliansyah * Mail Universitas Bina Sarana Informatika, Indonesia
  • Muhammad Ridho Caroko Universitas Bina Sarana Informatika, Indonesia
  • Heny Sumarno Universitas Bina Sarana Informatika, Indonesia
  • Hendro Priyono Universitas Bina Sarana Informatika, Indonesia
  • Linda Maulida Universitas Bina Sarana Informatika, Indonesia
DOI: https://doi.org/10.47065/bit.v7i2.2659

Abstract

The main problem faced is the large amount of unstructured sales data, making it difficult to perform manual analysis. With the application of the K-Means algorithm, sales data can be grouped into clusters representing products with high and low sales. The research process begins with the stages of problem identification, data collection, preprocessing, application of the K-Means algorithm, evaluation of clustering results, and then analysis and interpretation. Iteration results show that cluster C1 consists of a number of high-selling sales data, while cluster C2 encompasses the majority of low-selling sales data. Evaluation using the Davies-Bouldin Index (DBI) yields a value of 0.2818, indicating fairly good cluster quality, while the Silhouette Plot provides values of 0.082 for C1 and 0.276 for C2, indicating that cluster C2 is more stable compared to C1. Scatter Plot visualization shows the data distribution forming a slanted pattern from C1 to C2. The result of this research is that by using the K-Means algorithm, it can effectively cluster sales data of printed products, so it can be used as a basis for business decision-making related to marketing strategies, stock control, and product performance evaluation.

References

J. K. Wororomi et al., Data Mining (Memahami Pola di Balik Angka). Purbalingga: EUREKA MEDIA AKSARA, 2024.

Amna et al., Data Mining. Padang: PT GLOBAL EKSEKUTIF TEKNOLOGI, 2022.

N. Arianty, Implikasi Pemasaran Dalam Kinerja Usaha. Medan: UMSU Press, 2024.

D. R. Sari, A. P. Windarto, D. Hartama, and Solikhun, “Sistem Pendukung Keputusan untuk Rekomendasi Kelulusan Sidang Skripsi Menggunakan Metode AHP-TOPSIS,” J. Teknol. dan Sist. Komput., vol. 6, no. 1, pp. 1–6, 2018, doi: 10.14710/jtsiskom.6.1.2018.1-6.

Y. D. Putra, M. Sudarma, and I. B. A. Swamardika, “Clustering History Data Penjualan Menggunakan Algoritma K-Means,” Maj. Ilm. Teknol. Elektro, vol. 20, no. 2, pp. 195–202, 2021.

S. Setiyanto et al., Penerapan Teknologi Untuk Penelitian Dan Penyampaian Informasi. Bandung: Widina Media Utama, 2023.

F. Juliawati, R. Buaton, and R. Saragih, “Pengelompokan Data Mining Penerimaan Bantuan Pangan Non Tunai (BPNT) Menggunakan Metode Clustering (Studi Kasus : Kantor Desa Payabakung Hamparan Perak),” Explorer (Hayward)., vol. 3, no. 2, pp. 69–76, 2023, doi: 10.47065/explorer.v3i2.793.

R. Ariansyah, “Sistem Pendukung Keputusan Penentuan Penerima Bantuan Langsung Tunai (BLT) dengan Kombinasi Metode Clustering K-Means dan Visekriterijumsko Kompromisno Rangiranje (VIKOR),” ADA J. Inf. Syst. Res., vol. 1, no. 3, pp. 129–140, 2024, doi: 10.64366/adajisr.v1i3.51.

Z. Setiawan, ‎Muhammad Fajar, A. M. Priyatno, A. Y. P. Putri, M. A. Anggi Yhurinda Perdana Putri, and S. Yuliyanti, Buku Ajar Data Mining. Jambi: PT. Sonpedia Publishing Indonesia, 2023.

M. A. M. Hamu and A. C. Talakua, “Optimalisasi Manajemen Bantuan Sosial Dengan Implementasi Data Mining Menggunakan Algoritma K-Means Clustering,” J. Ilmu Komput. Univ. Katolik Widya Mandir, vol. 1, no. 1, pp. 7–12, 2024.

N. Siti Paridah and M. Martanto, “Klasterisasi Penerima Dana Bantuan Program Keluarga Harapan Menggunakan Metode K-Means Pada Desa Gereba,” JATI (Jurnal Mhs. Tek. Inform., vol. 8, no. 1, pp. 1036–1043, 2024, doi: 10.36040/jati.v8i1.8873.

A. S. Nugroho and Sulyono, “Penerapan Metode K-Means Clustering Untuk Penentuan Eligibilitas Bantuan Langsung Tunai Berbasis Mobile,” J. Inf. Technol. Ampera, vol. 5, no. 1, pp. 2774–2121, 2024, doi: 10.51519/journalita.v5i1.510.

V. Hutagaol, D. Anggraeni, and A. Nata, “PENERAPAN DATA MINING UNTUK CLUSTERING MASYARAKAT KURANG MAMPU PADA DESA RAWANG PASAR VI DENGAN ALGORITMA K-MEANS,” JIPI (Jurnal Ilm. Penelit. dan Pembelajaran Inform., vol. 10, no. 1, pp. 304–312, 2025.

D. Hartama, Wanayumini, and I. S. Damanik, Optimasi Algoritma Clustering Studi Kasus Lokasi Bencana Alam Di Indonesia. Indramayu: PT. Adab Indonesia, 2024.

Mustika et al., Data Mining Dan Aplikasinya. Bandung: Widina Bhakti Persada Bandung, 2021.

R. M. Sari, A. Rizka, N. A. Putri, and A. Efriana, Perhitungan Metode Clustering. Payakumbuh: Serasi Media Teknologi, 2024.

S. Ufriani, Jasmir, and Y. Arvita, “Penerapan Algoritma Clustering K-Means Untuk Menentukan Prioritas Penerima Bantuan Dana Sosial PKH Di Kelurahan Kampung Singkep,” J. Inform. Dan Rekayasa Komput. ( JAKAKOM ), vol. 3, no. 1, pp. 342–350, 2023.

D. Jollyta, M. Siddik, H. Mawengkang, and S. Efendi, Teknik Evaluasi Cluster Solusi Menggunakan Phyton Dan Rapidminer. Yogyakarta: deepublish, 2021.

S. R. Agustin, I. Purnamasari, and B. N. Sari, “Implementasi K-Means Untuk Pengelompokan Kategori Penjualan Barang Berbasis Web,” vol. 5, no. 3, pp. 167–176, 2025, doi: 10.47065/jimat.v5i3.610.

M. Setiyo and B. Waluyo, Metodologi Penelitian dan Perancangan Eksperimen. Magelang: UNIMMA PRESS, 2025.

Dimensions Badge
Published
2026-06-22
How to Cite
Susliansyah, Ridho Caroko, M., Sumarno, H., Priyono, H., & Maulida, L. (2026). Pengelompokan Data Penjualan Produk Cetakan Pada Algoritma K-Means Dengan Bantuan Tool Orange. Bulletin of Information Technology (BIT), 7(2), 115 - 123. https://doi.org/10.47065/bit.v7i2.2659
Issue
Vol 7 No 2 (2026)
Section
Articles

Copyright (c) 2026 Susliansyah, Muhammad Ridho Caroko, Heny Sumarno, Hendro Priyono, Linda Maulida

Creative Commons License

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

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

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).