Penerapan Algoritma K-Nearest Neighbor Untuk Pengelolaan Efisien Tata Letak Buku Dalam Lingkungan Perpustakaan

 (*)Dzulfikri Akbar Dollar Mail (Universitas Islam Negeri Sumatera Utara, Medan, Indonesia)
 Ilka Zufria (Universitas Islam Negeri Sumatera Utara, Medan, Indonesia)

(*) Corresponding Author

Submitted: December 17, 2023; Published: December 30, 2023

Abstract

The library plays a central role in providing efficient access to information tailored to the interests of the community. The current system of organizing the library at the Medan City Library and Archives Department involves using call numbers. This system isn't very efficient for readers looking for interesting books, which can decrease people's interest in reading and perceive the library as a dull place. Hence, researchers have attempted to optimize book layout by prioritizing the most popular books. Using the K-Nearest Neighbor algorithm to optimize the book layout at the Medan City Library and Archives Department can assist in arranging book patterns based on historical borrowing data and facilitate better access to collections favored by library visitors. The research method involves collecting book borrowing data from previous months and processing it using the K-Nearest Neighbor Algorithm with Euclidean Distance calculation. The research results demonstrate that implementing this algorithm successfully predicts book arrangement patterns that align with reader interests. An adaptively arranged layout enhances the availability of popular books in easily accessible areas of the library for visitors. This is evident from the research findings in May, where the priority for the following month was the general collection. Similarly, in June, the priority was indeed the general collection, confirming that the algorithm's use of K-Nearest Neighbor is successful in optimizing book layout.

Keywords


K-Nearest Neighbor Algorithm; Book Collection Optimization; Euclidean Distance; Adaptive Book Arrangement Patterns; Information Access Convenience; Book Layout

Full Text:

PDF


Article Metrics

Abstract view : 201 times
PDF - 69 times

References

Y. Panjaitan, M. I. Zul, and I. Surya, “Sistem Pemilah Topik Diskusi pada Forum Diskusi Mahasiswa PCR Berbasis Web Menggunakan Algoritma KNN,” J. Sist. dan Teknol. Inf., vol. 7, no. 3, p. 160, 2019, doi: 10.26418/justin.v7i3.27465.

L. Anshori, R. R. M. Putri, and Tibyani, “Implementasi Metode K-Nearest Neighbor untuk Rekomendasi Keminatan Studi (Studi Kasus : Jurusan Teknik Informatika Universitas Brawijaya),” J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 2, no. 7, pp. 2745–2753, 2018, [Online]. Available: https://www.researchgate.net/publication/321097020_Implementasi_Metode_K-Nearest_Neighbor_untuk_Rekomendasi_Keminatan_Studi_Studi_Kasus_Jurusan_Teknik_Informatika_Universitas_Brawijaya

H. Dharmawan, Tukino, S. Shofiah Hilabi, and I. Karniawulan, “Sistem Rekomendasi Buku Dengan Metode K-Nearest Neighbor (K-Nn) Pada Gramedia,” Zo. J. Sist. Inf., vol. 5, no. 1, pp. 16–25, 2023, doi: 10.31849/zn.v5i1.12203.

r a manullang and f a Sianturi, “Penerapan Algoritma K-Nearest Neighbor Untuk Memprediksi Kelulusan Mahasiswa,” J. Ilmu Komput. Dan …, vol. 4, no. 2, pp. 15–23, 2021, [Online]. Available: http://ejournal.sisfokomtek.org/index.php/jikom/article/view/155

A. M. Habibi and R. R. Santika, “Implementasi Algoritma K-Nearest Neighbor dalam Menentukan Jurusan Menggunakan Metode Euclidean Distance Berbasis Web Pada SMP Setia Gama,” Skanika, vol. 3, no. 4, pp. 7–14, 2020.

M. Kadafi, “Klasifikasi Text Judul Buku Perpustakaan Untuk Menentukan Kategori Buku Menggunakan K-Nearest Neighbor,” Syst. Inf. Syst. Informatics J., vol. 6, no. 2, pp. 47–53, 2021, doi: 10.29080/systemic.v6i2.1056.

L. Farokhah, “Implementasi K-Nearest Neighbor untuk Klasifikasi Bunga Dengan Ekstraksi Fitur Warna RGB,” J. Teknol. Inf. dan Ilmu Komput., vol. 7, no. 6, pp. 1129–1136, 2020, doi: 10.25126/jtiik.2020722608.

E. Buulolo, Data Mining Untuk Perguruan Tinggi, Avinda Yud. Yogyakarta: Deepublish, 2020. [Online]. Available: https://books.google.co.id/books?id=-K_SDwAAQBAJ&printsec=frontcover&hl=id&source=gbs_ge_summary_r&cad=0#v=onepage&q=data mining&f=false

A. D. Adhi Putra, “Analisis Sentimen pada Ulasan pengguna Aplikasi Bibit Dan Bareksa dengan Algoritma KNN,” JATISI (Jurnal Tek. Inform. dan Sist. Informasi), vol. 8, no. 2, pp. 636–646, 2021, doi: 10.35957/jatisi.v8i2.962.

D. Rahmawati, M. Puspa Putri I, M. Ulum, and K. Joni, “Identification and Classification of Pathogenic Bacteria Using the K-Nearest Neighbor Method,” JEEE-U (Journal Electr. Electron. Eng., vol. 5, no. 1, pp. 60–70, 2021, doi: 10.21070/jeeeu.v5i1.1221.

A. Tangkelayuk, “The Klasifikasi Kualitas Air Menggunakan Metode KNN, Naïve Bayes, dan Decision Tree,” JATISI (Jurnal Tek. Inform. dan Sist. Informasi), vol. 9, no. 2, pp. 1109–1119, 2022, doi: 10.35957/jatisi.v9i2.2048.

R. K. Dinata, F. Fajriana, Z. Zulfa, and N. Hasdyna, “Klasifikasi Sekolah Menengah Pertama/Sederajat Wilayah Bireuen Menggunakan Algoritma K-Nearest Neighbors Berbasis Web,” CESS (Journal Comput. Eng. Syst. Sci., vol. 5, no. 1, p. 33, 2020, doi: 10.24114/cess.v5i1.14962.

M. Azam, T. Ahmed, F. Sabah, and M. I. Hussain, “Feature Extraction based Text Classification using K-Nearest Neighbor Algorithm,” IJCSNS Int. J. Comput. Sci. Netw. Secur., vol. 18, no. 12, pp. 95–101, 2018, [Online]. Available: http://paper.ijcsns.org/07_book/201812/20181213.pdf

V. Alvian, D. Hidayatullah, A. Nilogiri, H. Azizah, and A. Faruq, “Klasifikasi Siswa Berprestasi Menggunakan Metode K-Nearest Neighbor (KNN) Pada SMA Negeri 2 Situbondo Classification Of Achieving Students Using K-Nearest Neighbor (KNN) Method At SMA Negeri 2 Situbondo,” J. Smart Teknol., vol. 3, no. 6, pp. 2774–1702, 2022, [Online]. Available: http://jurnal.unmuhjember.ac.id/index.php/JST

M. J. Hartmann and G. Carleo, “Neural-Network Approach to Dissipative Quantum Many-Body Dynamics,” Phys. Rev. Lett., vol. 122, no. 25, pp. 1–10, 2019, doi: 10.1103/PhysRevLett.122.250502.

P. Kamath, P. Patil, S. Shrilatha, and S. Sowmya, “Crop yield forecasting using data mining,” Glob. Transitions Proc., vol. 2, no. 2, pp. 402–407, 2021, doi: 10.1016/j.gltp.2021.08.008.

E. S. Nugraha, A. R. Padri, O. Nurdiawan, A. Faqih, and S. Anwar, “Implementasi Aplikasi Pengaduan Masyarakat Berbasis Android Pada Gedung DPRD,” JURIKOM (Jurnal Ris. Komputer), vol. 8, no. 6, p. 360, 2021, doi: 10.30865/jurikom.v8i6.3679.

A. Akhmadi, N. Laksitarini, and G. P. Nabila, “Preferensi Pengunjung Mahasiswa Generasi Z Masa Kini Terhadap Atribut Learning Space di Perpustakaan Akademik,” Arsitektura, vol. 18, no. 1, p. 109, 2020, doi: 10.20961/arst.v18i1.40967.

R. Sukmawan, U. Gultom, R. Haroen, and V. Yasin, “Sistem Peminjaman Dan Pengembalian Buku Perpustakaan Keliling Berbasis Web Menggunakan Algoritma String Matching Pada Suku Dinas Perpustakaan Dan Kearsipan Kota Administrasi Jakarta Utara,” J. Inf. Syst. Informatics Comput., vol. 5, no. 1, p. 144, 2021, doi: 10.52362/jisicom.v5i1.384.

D. Putra and A. Wibowo, “Prediksi Keputusan Minat Penjurusan Siswa SMA Yadika 5 Menggunakan Algoritma Naïve Bayes,” Pros. Semin. Nas. Ris. Dan Inf. Sci., vol. 2, pp. 84–92, 2020, [Online]. Available: https://tunasbangsa.ac.id/seminar/index.php/senaris/article/view/147

T. D. E. Putra, H. Khusnuliawati, and A. N. Hernanjaya, “Penerapan Framework Codeigniter pada Pembangunan Sistem Informasi Akademik di Universitas Sahid Surakarta,” Gaung Inform., vol. 11, no. 2, pp. 78–88, 2018.

Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Penerapan Algoritma K-Nearest Neighbor Untuk Pengelolaan Efisien Tata Letak Buku Dalam Lingkungan Perpustakaan

Refbacks

  • There are currently no refbacks.


Copyright (c) 2023 Dzulfikri Akbar Dollar

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

Jurnal Sistem Komputer dan Informatika (JSON)
Dikelola oleh STMIK Budi Darma
Sekretariat : Jln. Sisingamangaraja No. 338 Telp 061-7875998
email : jurnal.json@gmail.com


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