Top-N Recommendation (Implicit Feedback)
DOI:
https://doi.org/10.54074/jicsa.v1i02.22Keywords:
Recommender System, Collaborative Filtering, Implicit Feedback, Top - N RecommendationAbstract
The rapid growth of digital platforms has led to a massive increase in user-item interaction data, most of which is recorded as implicit
feedback such as purchase history and reading duration. Unlike explicit ratings, implicit feedback presents fundamental challenges
including extreme sparsity and ambiguity, as non-interaction does not necessarily indicate disinterest. This study develops a Top-N
book recommendation system by implementing Item-Based Collaborative Filtering (IBCF) as a baseline and Alternating Least
Squares (ALS) as the primary model, addressing the challenge of a highly sparse dataset (13,876 users × 123,069 items). The
methodology involves transforming raw interaction data into Compressed Sparse Row (CSR) format, performing systematic
hyperparameter tuning on the ALS model, and implementing rigorous data preprocessing techniques to optimize performance.
The experimental results demonstrate a progressive improvement trajectory: the baseline IBCF model achieved a Mean Average
Precision at 10 (MAP@10) score of 0.0186, the initial ALS model improved to 0.0243, hyperparameter tuning further increased
performance to 0.0257, while the integration of systematic data preprocessing (K-Core filtering) with advanced hyperparameter
tuning ultimately yielded a score of 0.0622 representing a 234% improvement over the baseline. Qualitative analysis reveals that
while IBCF produces monotonous and homogeneous recommendations limited to similar publishers and series, ALS
provides substantially more diverse and exploratory results by capturing latent behavioral patterns across multiple genres and
thematic categories. This study concludes that the optimized ALS model, combining matrix factorization with rigorous data
engineering, is significantly more effective than in handling sparse implicit feedback, delivering superior rankingaccuracy, enhanced recommendation diversity, and improved user discovery experience.
References
[1] S. Raza, M. Rahman, S. Kamawal, A. Toroghi, and A. Raval, “A Comprehensive Review of Recommender Systems : Transitioning from Theory to Practice”.
[2] R. Lai, R. Chen, and C. Zhang, “A Survey on Data-Centric Recommender Systems”.
[3] E. Hasan, M. Rahman, C. Ding, J. X. Huang, and S. Raza, “Review-based Recommender Systems: A Survey of Approaches, Challenges and Future Perspectives,” vol. XX, no. X, 2025.
[4] Y. Li, K. Liu, R. Satapathy, and S. Wang, “Recent Developments in Recommender Systems : A Survey,” vol. 14, no. 8, pp. 1–21, 2021.
[5] M. Gen-recsys et al., A Review of Modern Recommender Systems Using Generative, vol. 1, no. 1. Association for Computing Machinery. doi: 10.1145/3637528.3671474.
[6] V. Gangal, M. Blake, and H. Systems, “CoRL : Environment Creation and Management Focused on System Integration ∗,” pp. 1–14, 2023.
[7] X. He, X. Wang, and M. Wang, “LightGCN : Simplifying and Powering Graph Convolution Network for Recommendation”.
[8] A. Betina and M. Hsieh, “CM CONGRUENCE AND TRIVIAL ZEROS OF THE KATZ p -ADIC L -FUNCTIONS FOR CM FIELDS,” pp. 1–55, 2000.
[9] M. Filip and A. J. W. Thom, “multireference systems,” pp. 1–13.
[10] L. W. Member, X. H. Member, and X. W. Member, “A Survey on Accuracy-oriented Neural Recommendation : From Collaborative Filtering to Information-rich Recommendation,” pp. 1–20.
[11] A. Petrov and C. Macdonald, A Systematic Review and Replicability Study of BERT4Rec for Sequential Recommendation, vol. 1, no. 1. Association for Computing Machinery.doi: 10.1145/3523227.3548487.
[12] Z. Zhao, W. Fan, J. Li, Y. Liu, X. Mei, and Y. Wang, “Recommender Systems in the Era of Large Language Models ( LLMs ),” 2023.
[13] P. K. Bhatraju, M. Wurfel, and M. Yetisgen, “Identifying ARDS using the Hierarchical Attention Network with Sentence Objectives Framework”.
[14] B. Bogosel and D. Bucur, “On the polygonal faber-krahn inequality,” vol. 1, 1923.
[15] M. Zecchin, S. Antipolis, and D. Gesbert, “Communication-Efficient Distributionally Robust Decentral- ized Learning,” pp. 1–26, 2022.
[16] B. Bischl et al., “Best Practices and Open Challenges arXiv : 2107 . 05847v3 [ stat . ML ] 24 Nov 2021,” no. Ml.
[17] E. Lobacheva, M. Kodryan, N. Chirkova, A. Malinin, and D. Vetrov, “On the Periodic Behavior of Neural Network Training with Batch Normalization and Weight Decay arXiv : 2106 . 15739v3 [ cs . LG ] 15 Jan 2022,” no. NeurIPS, pp. 1–27, 2021.
[18] Y. Tamm, ality Metrics in Recommender Systems : Do We Calculate Metrics Consistently ?, vol. 1, no. 1. Associationfor Computing Machinery, 2021. doi: 10.1145/3460231.3478848.
[19] K. Y. Zeng el., “Local evidence for collective spin excitations in a distorted kagome antiferromagnet: Pr 3 BWO 9,” pp. 1–7, 2021.
[20] Y. Wang, W. Ma, M. Zhang, Y. Liu, and S. Ma, “A Survey on the Fairness of Recommender Systems,” J. ACM, vol. 37, no. 4, 2022.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Bethania Hasibuan, Rahel Uli Rotua Simanjuntak, Christoffel Teofani Napitupulu, Chika Situmorang, Difya Laurensya Ambarita

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

