Download pdf
Performance comparison and analysis of SVD and ALS in recommendation system
- 1 Shanghai University
* Author to whom correspondence should be addressed.
Abstract
This research predominantly focuses on the electronic segment of the Amazon dataset. In this setting, this study’s primary objective is to use this particular dataset to carry out a detailed comparative analysis of two matrix factorization-based collaborative filtering techniques, namely Singular Value Decomposition (SVD) and Alternating Least Squares (ALS). The findings stemming from this investigation reveal a notable contrast in the performance of these algorithms. Specifically, the SVD algorithm demonstrates significantly higher overall accuracy when compared to ALS. This observation suggests that in scenarios characterized by denser and smaller datasets, the SVD algorithm outperforms ALS by a considerable margin. The implications of these results underscore the significance of algorithm selection in recommender systems, emphasizing that the performance of collaborative filtering methods can vary markedly depending on the dataset’s characteristics. Additionally, this research highlights the potential limitations of ALS in scenarios similar to the one explored here, shedding light on the importance of tailoring algorithmic choices to the specific data environment. Overall, these findings contribute valuable insights to the field of recommendation systems and provide guidance for algorithm selection based on dataset properties.
Keywords
Recommendation Models, Collaborative Filtering, Singular Value Decomposition, Alternating Least Squares
[1]. Resnick, P., & Varian, H. R. (1997). Recommender systems. Communications of the ACM, 40(3), 56-58.
[2]. Beheshti, A., Yakhchi, S., Mousaeirad, S., Ghafari, S. M., Goluguri, S. R., & Edrisi, M. A. (2020). Towards cognitive recommender systems. Algorithms, 13(8), 176.
[3]. Linden, G., Smith, B., & York, J. (2003). Amazon. com recommendations: Item-to-item collaborative filtering. IEEE Internet computing, 7(1), 76-80.
[4]. Bennett, J., & Lanning, S. (2007). The netflix prize. In Proceedings of KDD cup and workshop, 2007, 35.
[5]. Madathil, M. (2017). Music recommendation system spotify-collaborative filtering. Reports in Computer Music. Aachen University, Germany 1-4.
[6]. Su, X., & Khoshgoftaar, T. M. (2009). A survey of collaborative filtering techniques. Advances in artificial intelligence, 1-19.
[7]. Koren, Y., Rendle, S., & Bell, R. (2021). Advances in collaborative filtering. Recommender systems handbook, 91-142.
[8]. Kalman, D. (1996). A singularly valuable decomposition: the SVD of a matrix. The college mathematics journal, 27(1), 2-23.
[9]. Zhou, Y., Wilkinson, D., Schreiber, R., & Pan, R. (2008). Large-scale parallel collaborative filtering for the netflix prize. In Algorithmic Aspects in Information and Management: 4th International Conference, 4, 337-348.
[10]. Herlocker, J. L., Konstan, J. A., Terveen, L. G., & Riedl, J. T. (2004). Evaluating collaborative filtering recommender systems. ACM Transactions on Information Systems, 22(1), 5-53.
Cite this article
Zhao,T. (2024). Performance comparison and analysis of SVD and ALS in recommendation system. Applied and Computational Engineering,49,142-148.
Data availability
The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.
Disclaimer/Publisher's Note
The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
About volume
Volume title: Proceedings of the 4th International Conference on Signal Processing and Machine Learning
© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and
conditions of the Creative Commons Attribution (CC BY) license. Authors who
publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons
Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this
series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series'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 series.
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 (See
Open access policy for details).