Abstract
Recommendation systems (RS) aim at prediction of user preferences for a given set of items. Conventionally, RS uses collaborative filtering, content-based filtering, or hybrid of both the approaches for generating recommendation lists. Each of these approaches suffers from one or the other problems such as cold-start, sparsity, scalability, processing streaming data, and low latency. Furthermore, with high frequency of data updates, the user preferences change too, that demands for latest recommendation list for each user based on recent activity, capturing the concept shift and eliminating the stale item preferences. Hence, we propose a solution approach based on matrix factorization, that is robust, handles sparse and streaming data. The user preferences are represented in a matrix form and are decomposed into smaller matrices for ease of interpretation and information retrieval. Four matrix factorization techniques, namely NMF, NMFALS, CUR, and SVD, have been used for empirical analysis, and it is found that SVD outperforms NMF, NMFALS, and CUR in terms of time and recommendation accuracy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Erkin Z et al (2012) Privacy-preserving content-based recommender system. ACM
Ahn HJ (2008) A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem. Inf Sci 178(1):37–51. https://doi.org/10.1016/j.ins.2007.07.024
Bobadilla J, Serradilla F, Hernando A (2009) Collaborative filtering adapted to recommender systems of e-learning. Knowl-Based Syst 22(4):261–265. https://doi.org/10.1016/j.knosys.2009.01.008
De Campos LM et al (2010) Combining content-based and collaborative recommendations: a hybrid approach based on Bayesian networks. Int J Approx Reason 51(7):785–799
Al-Bakri NF, Hashim SH (2018) Reducing data sparsity in recommender systems. Al-Nahrain J Sci 21(2):138–147
Kumar KV, Reddy RR, Balasubramanian R, Sridhar M, Sridharan K, Venkataraman D (2015) Automated recommendation system with feedback analysis. Int J Appl Eng Res 10:22201–22210
Kiran MVK, Vinodhini RE, Archanaa R, Vimalkumar K (2017) User specific product recommendation and rating system by performing sentiment analysis on product reviews. In: 2017 4th international conference on advanced computing and communication systems (ICACCS)
Choi K, Suh Y (2013) A new similarity function for selecting neighbors for each target item in collaborative filtering. Knowl-Based Syst 37:146–153. https://doi.org/10.1016/j.knosys.2012.07.019
Montes-GarcÃa A et al (2013) Towards a journalist-based news recommendation system: the Wesomender approach. Expert Syst Appl 40(17):6735–6741
Lee DD, Sebastian Seung H (2001) Algorithms for non-negative matrix factorization. Advances in neural information processing systems
Wang X, Zhang J (2014) Using incremental clustering technique in collaborative filtering data update. In: Proceedings of the 2014 IEEE 15th international conference on information reuse and integration (IEEE IRI 2014). IEEE
Liu H, Li X, Zheng X (2013) Solving non-negative matrix factorization by alternating least squares with a modified strategy. Data Min Knowl Discov 26(3):435–451. https://doi.org/10.1007/s10618-012-0265-y
Reshma R, Sowmya V, Soman KP (2016) Dimensionality reduction using band selection technique for kernel based hyperspectral image classification. In: 6th international conference on advances in computing and communications, ICACC-2016, Rajagiri School of Engineering and Technology, vol 93, pp 396–402
Pan M, Yang Y, Mi Z (2016) Research on an extended SVD recommendation algorithm based on user’s neighbor model. In: 2016 7th IEEE international conference on software engineering and service science (ICSESS). IEEE. https://doi.org/10.1137/S0097539704442702
Kogbetliantz EG (1955) Solution of linear equations by diagonalization of coefficients matrix. Q Appl Math 13(2):123–132
Drineas P, Kannan R, Mahoney MW (2006) Fast Monte Carlo algorithms for matrices III: computing a compressed approximate matrix decomposition. SIAM J Comput 36(1):184–206
Maxwell Harper F, Konstan JA (2015) The MovieLens datasets: history and context. ACM Trans Interact Intell Syst (TiiS) 5(4):Article 19, 19pp. https://doi.org/10.1145/2827872
Greene D, Cunningham P (2006) Practical solutions to the problem of diagonal dominance in kernel document clustering. In: Proceedings of the 23rd international conference on Machine learning. ACM
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Lekshmi Priya, T., Sandhya, H. (2021). Matrix Factorization for Recommendation System. In: Chiplunkar, N.N., Fukao, T. (eds) Advances in Artificial Intelligence and Data Engineering. AIDE 2019. Advances in Intelligent Systems and Computing, vol 1133. Springer, Singapore. https://doi.org/10.1007/978-981-15-3514-7_22
Download citation
DOI: https://doi.org/10.1007/978-981-15-3514-7_22
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-3513-0
Online ISBN: 978-981-15-3514-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)