SVD-based incremental approaches for recommender systems. (English) Zbl 1320.68158
Summary: Due to the serious information overload problem on the Internet, recommender systems have emerged as an important tool for recommending more useful information to users by providing personalized services for individual users. However, in the “big data” era, recommender systems face significant challenges, such as how to process massive data efficiently and accurately. In this paper we propose an incremental algorithm based on singular value decomposition (SVD) with good scalability, which combines the Incremental SVD algorithm with the Approximating the Singular Value Decomposition (ApproSVD) algorithm, called the Incremental ApproSVD. Furthermore, strict error analysis demonstrates the effectiveness of the performance of our Incremental ApproSVD algorithm. We then present an empirical study to compare the prediction accuracy and running time between our Incremental ApproSVD algorithm and the Incremental SVD algorithm on the MovieLens dataset and Flixster dataset. The experimental results demonstrate that our proposed method outperforms its counterparts.
Keywords:
singular value decomposition; incremental algorithm; recommender system; experimental evaluationSoftware:
svdpackReferences:
| [1] | Marlin, B., Collaborative filtering: a machine learning perspective (2004), University of Toronto, Ph.D. thesis |
| [2] | Xue, G.-R.; Lin, C.; Yang, Q.; Xi, W.; Zeng, H.-J.; Yu, Y.; Chen, Z., Scalable collaborative filtering using cluster-based smoothing, (Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2005), ACM), 114-121 |
| [3] | Demir, G. N.; Uyar, A. S.; Ögüdücü, S. G., Graph-based sequence clustering through multiobjective evolutionary algorithms for web recommender systems, (Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation (2007), ACM), 1943-1950 |
| [4] | Chakraborty, P. S., A scalable collaborative filtering based recommender system using incremental clustering, (Advance Computing Conference. Advance Computing Conference, IACC 2009 (2009), IEEE International, IEEE), 1526-1529 |
| [5] | Funk, S., Netflix update: try this at home (2006) |
| [6] | Zhang, S.; Wang, W.; Ford, J.; Makedon, F., Learning from incomplete ratings using non-negative matrix factorization, (SDM (2006), SIAM), 549-553 |
| [7] | Cheng, Y.; Church, G. M., Biclustering of expression data, (ISMB, vol. 8 (2000)), 93-103 |
| [8] | Chen, G.; Wang, F.; Zhang, C., Collaborative filtering using orthogonal nonnegative matrix tri-factorization, Inf. Process. Manag., 45, 3, 368-379 (2009) |
| [9] | Shan, H.; Banerjee, A., Bayesian co-clustering, (Eighth IEEE International Conference on Data Mining. Eighth IEEE International Conference on Data Mining, ICDM’08 (2008), IEEE), 530-539 |
| [10] | Zhou, X.; He, J.; Huang, G.; Zhang, Y., A personalized recommendation algorithm based on approximating the singular value decomposition (ApproSVD), (Proceedings of the 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology, vol. 02 (2012), IEEE Computer Society), 458-464 |
| [11] | Golub, G. H.; Van Loan, C. F., Matrix Computations, vol. 3 (2012), JHU Press |
| [12] | Berry, M. W., Large-scale sparse singular value computations, Int. J. Supercomput. Appl., 6, 1, 13-49 (1992) |
| [13] | Nakayama, H.; Hattori, A., Incremental learning and forgetting in RBF networks and SVMs with applications to financial problems, (Knowledge-Based Intelligent Information and Engineering Systems (2003), Springer), 1109-1115 |
| [14] | Sarwar, B.; Karypis, G.; Konstan, J.; Riedl, J., Incremental singular value decomposition algorithms for highly scalable recommender systems, (Fifth International Conference on Computer and Information Technology (2002), Citeseer), 27-28 |
| [15] | Baker, C. G.; Gallivan, K. A.; Van Dooren, P., Low-rank incremental methods for computing dominant singular subspaces, Linear Algebra Appl., 436, 8, 2866-2888 (2012) · Zbl 1241.65036 |
| [16] | Zha, H.; Simon, H. D., On updating problems in latent semantic indexing, SIAM J. Sci. Comput., 21, 2, 782-791 (1999) · Zbl 0952.65034 |
| [17] | Ren, C.-X.; Dai, D.-Q., Incremental learning of bidirectional principal components for face recognition, Pattern Recognit., 43, 1, 318-330 (2010) · Zbl 1187.68493 |
| [18] | Zheng, Q.; Wang, X.; Deng, W.; Liu, J.; Wu, X., Incremental projection vector machine: a one-stage learning algorithm for high-dimension large-sample dataset, (AI 2010: Advances in Artificial Intelligence (2011), Springer), 132-141 |
| [19] | Brand, M., Incremental singular value decomposition of uncertain data with missing values, (Computer Vision ECCV 2002 (2002), Springer), 707-720 · Zbl 1034.68580 |
| [20] | Chandrasekaran, S.; Manjunath, B.; Wang, Y.-F.; Winkeler, J.; Zhang, H., An eigenspace update algorithm for image analysis, Graph. Models Image Process., 59, 5, 321-332 (1997) |
| [21] | Levey, A.; Lindenbaum, M., Sequential Karhunen-Loeve basis extraction and its application to images, IEEE Trans. Image Process., 9, 8, 1371-1374 (2000) · Zbl 1001.68586 |
| [22] | Allen, G. I.; Grosenick, L.; Taylor, J., A generalized least-square matrix decomposition, J. Am. Stat. Assoc., 109, 505, 145-159 (2014) · Zbl 1367.62184 |
| [23] | Dax, A., From eigenvalues to singular values: a review, Adv. Pure Math., 3, 8 (2013) |
| [24] | Eckart, C.; Young, G., The approximation of one matrix by another of lower rank, Psychometrika, 1, 3, 211-218 (1936) · JFM 62.1075.02 |
| [25] | Sarwar, B.; Karypis, G.; Konstan, J.; Riedl, J., Application of dimensionality reduction in recommender system-a case study, (Proceedings of the ACM Web KDD workshop on Web Mining for E-Commerce (2000), ACM Press: ACM Press New York), 82-90 |
| [26] | Polat, H.; Du, W., SVD-based collaborative filtering with privacy, (Proceedings of the 2005 ACM Symposium on Applied Computing (2005), ACM), 791-795 |
| [27] | Sarwar, B.; Karypis, G.; Konstan, J.; Riedl, J., Analysis of recommendation algorithms for e-commerce, (Proceedings of the 2nd ACM Conference on Electronic Commerce (2000), ACM), 158-167 |
| [28] | Ghazanfar, M. A.; Prügel-Bennett, A., The advantage of careful imputation sources in sparse data-environment of recommender systems: generating improved SVD-based recommendations, Informatica (Slov.), 37, 1, 61-92 (2013) |
| [29] | Berry, M. W.; Dumais, S. T.; O’Brien, G. W., Using linear algebra for intelligent information retrieval, SIAM Rev., 37, 4, 573-595 (1995) · Zbl 0842.68026 |
| [30] | MovieLens |
| [31] | Flixster dataset |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
