Research ArticleJournal of Scientometric ResearchVol. 14 | Issue 1 | 2025 | pp. 32–45Open access
Personalized Library Book Recommendations Using K-Means Clustering and Association Rules
- 1*,
- 1,
- 1
- 1 UIN Sunan Ampel, INDONESIA.
Published in Journal of Scientometric Research
Correspondence: Faris Mushlihul Amin
UIN Sunan Ampel, INDONESIA.
Email: faris@uinsby.ac.id
Copyright: © 2025 Manuscript Technomedia. This is an open access article.
- Published:
- Aug 25, 2025
- Received:
- Oct 31, 2023
- Accepted:
- Nov 20, 2024
How to cite
Amin, F. M., Rusydiyah, E. F., & Azizah, A. N. (2025). Personalized Library Book Recommendations Using K-Means Clustering and Association Rules. Journal of Scientometric Research, 14(1), 32–45. https://doi.org/10.5530/jscires.20251005
Abstract
The library serves as the primary information source and has a significant impact on raising educational standards. This study aims to improve library service quality by developing a personalized book recommendation system. The personalization of the recommendation system is the design of a prediction model for books that each user will borrow based on the user's interests, behavior and other related information. The novelty of this study lies in the combination of K-Means Clustering and Association Rule techniques to create a more accurate recommendation model tailored to each user's preferences, behavior and other relevant information. One common issue in building recommendation systems is the Cold Start Problem, which refers to the challenge of making accurate recommendations for new users or items with little to no historical data. Therefore, K-Means Clustering is utilized to segment users based on their borrowing patterns, which helps address the Cold Start Problem by recommending popular books within each cluster. User information from book loan transactions is used as input for the clustering model. Next, a recommendation model for each cluster will be made using the Apriori algorithm. Apriori was chosen for its simplicity, low computational cost and ability to efficiently identify frequent patterns, making it ideal for large datasets. This study trials the number of clusters between k=3, 4, 5 and 6. The best results for the recommendation model used a combination of 6 clusters and the Apriori algorithm. The application of the clustering method can improve the recommendation model with a difference of 3.61% average accuracy, 0.67% average precision, 3.61% average recall and 0.49% average F1 score compared to the recommendation model without clustering method.
Keywords
Subject
Article metadata
| Title | Personalized Library Book Recommendations Using K-Means Clustering and Association Rules |
|---|---|
| Authors | Faris Mushlihul Amin; Evi Fatimatur Rusydiyah; Anisa Nur Azizah |
| Affiliations | UIN Sunan Ampel, INDONESIA. |
| Corresponding author | faris@uinsby.ac.id |
| Journal | Journal of Scientometric Research |
| Volume / Issue | Vol. 14, Issue 1 (2025) |
Also in this issue
- A Review on the 4.0 Industrial Revolution and its Impact on Human Resource Management Trendspp. 1–15
- Advancing Country-Level Research Benchmarking: A Bibliometric Multistage Principal Component Analysis- Based Composite Index Approachpp. 16–31
- Large Language Models in Biomedicine and Health: A Holistic Evaluation of the Effectiveness, Reliability and Ethics using Altmetricspp. 46–61
- Evaluating Community Detection Algorithms: A Focus on Effectiveness and Efficiencypp. 62–74
- Armenian Women in Science: An Analytical and Bibliometric Study of Current Trendspp. 75–85
Readers Also Viewed
Development and Validation of UV/visible Spectrophotometric Method for Estimation of Piroxicam from Bulk and Formulation
Sandip Mohan Honmane, Kunal Rajaram Yadav, Yuvraj Dilip Dange
Apr 23, 2025
Effects of Artificial Intelligence on Academic Performance of Library and Information Science University Students: A Meta-Analysis (2023-2025)
Kayode Sunday John Dada
Aug 6, 2026
Bridging Innovation and Impact: A Multidisciplinary Approach to Contemporary Research Challenges
Mueen Ahmed KK
Aug 11, 2026