K-Means Cluster as a Reading Interest Analysis Tool in the North Sumatra Provincial Library
DOI:
https://doi.org/10.59934/jaiea.v4i2.908Keywords:
K-Means Algorithm, Cluster, LibraryAbstract
This study aims to apply the K-Means algorithm in analyzing students' reading interests in regional libraries in North Sumatra. As library collections and information sources increase, understanding readers' preferences has become a key element in improving the quality of library services and collections. The K-Means algorithm was chosen because of its ability to group data based on similar characteristics, thus providing deeper insight into students' reading interest patterns. The data used in this study were obtained from the visitor information database per library, which includes the number of visits, types of books frequently borrowed, duration of visits, and categories of the most popular reading materials. The data were processed through several stages, namely preprocessing to clean and align the data, clustering using the K-Means algorithm, and cluster analysis. The analysis revealed that students can be grouped into several categories based on their reading interest patterns, such as groups with high interest in scientific literature, groups that predominantly read entertainment and fiction books, and groups with low levels of reading interest. Furthermore, the results of this study also show that students' reading interests fluctuate over time. The results of this study have practical implications for library managers in developing more targeted strategies, such as literacy programs, procuring books that suit visitors' needs, and optimizing data-based services. Therefore, this study is expected to help efforts to increase the number of visits and the level of user satisfaction.
Downloads
References
B. Masrufa and A. D. Ramandani, “Sinergi Kepemimpinan dan Literasi: Upaya Kepala Sekolah dalam Mengembangkan Perpustakaan Sekolah,” Irsyaduna J. Stud. Kemahasiswaaan, vol. 4, no. 1, pp. 40–55, 2024, doi: 10.54437/irsyaduna.v4i1.1550.
A. T. Permata, L. Setiawati, and L. Koerunnisa, “Analisis Penerapan Fungsi Manajemen George Robert Terry di Perpustakaan Pitimoss,” J. Librariansh. Inf. Sci., vol. 3, no. 2, p. 94, 2023.
S. Pujiono, R. Astuti, and F. Muhamad Basysyar, “Implementasi Data Mining Untuk Menentukan Pola Penjualan Produk Menggunakan Algoritma K-Means Clustering,” JATI (Jurnal Mhs. Tek. Inform., vol. 8, no. 1, pp. 615–620, 2024, doi: 10.36040/jati.v8i1.8360.
D. Bahtiar et al., “Pengenalan Dasar Instalasi Jaringan KomputerMenggunakan Mikrotik,” Kreat. Mhs. Inform., vol. 2, pp. 507–518, 2021.
J. A. Noyari, A. Aprillia, R. G. Munthe, and A. Sutarman, “Optimasi Kinerja Sistem Informasi Manajemen Kampus Menggunakan Teknik Data Mining,” vol. 3, no. 1, pp. 52–63, 2024.
U. W. Latifah, S. Bahri, and M. Satriandhini, “Implementasi Algoritma K-Means Clustering untuk Strategi Promosi Kampus IBISA,” JIKO (Jurnal Inform. dan Komputer), vol. 8, no. 2, p. 292, 2024, doi: 10.26798/jiko.v8i2.1307.
S. Ikmi, C. Jl, P. No, and M. Kota, “ALGORITMA K-MEANS UNTUK PENINGKATAN MODEL SEGMENTASI DATA ASET TETAP PADA PT . XYZ,” vol. 13, no. 1, pp. 1370–1377, 2025.
R. Nugraha, N. Suarna, I. Ali, and D. Rohman, “OPTIMASI PENGELOLAAN SAMPAH MELALUI MODEL PENGELOMPOKAN DENGAN ALGORITMA K-MEANS,” vol. 13, no. 1, pp. 646–652, 2025.
F. A. Fernaldy, A. A. Arifiyanti, D. Satria, and Y. Kartika, “TRACER STUDY ALUMNI UNIVERSITAS XYZ MENGGUNAKAN ALGORITMA K-,” vol. 13, no. 1, 2025.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Journal of Artificial Intelligence and Engineering Applications (JAIEA)

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