论文信息 - Netflix Prize and SVD

Netflix Prize and SVD

Singular Value Decompositions (SVD) have become very popular in the field of Collaborative Filtering. The winning entry for the famed Netflix Prize had a number of SVD models including SVD++ blended with Restricted Boltzmann Machines. Using these methods they achieved a 10 percent increase in accuracy over Netflix’s existing algorithm. In this paper I explore the different facets of a successful recommender model. I also will explore a few of the more prominent SVD based models such as Iterative SVD, SVD++ and Regularized SVD. This paper is designed for a person with basic knowledge of decompositions and linear algebra and attempts to explain the workings of these algorithms in a way that most can understand.

S. Gower | Stephen Gower

[1] Arkadiusz Paterek,et al. Improving regularized singular value decomposition for collaborative filtering , 2007 .

[2] Kenneth Y. Goldberg,et al. Eigentaste: A Constant Time Collaborative Filtering Algorithm , 2001, Information Retrieval.

[3] Yehuda Koren,et al. Factorization meets the neighborhood: a multifaceted collaborative filtering model , 2008, KDD.

[4] Patrick Seemann,et al. Matrix Factorization Techniques for Recommender Systems , 2014 .

[5] Geoffrey E. Hinton,et al. Restricted Boltzmann machines for collaborative filtering , 2007, ICML '07.

[6] Adam Prügel-Bennett,et al. The Advantage of Careful Imputation Sources in Sparse Data-Environment of Recommender Systems: Generating Improved SVD-based Recommendations , 2013, Informatica.

[7] Konstantinos G. Margaritis,et al. Applying SVD on Generalized Item-based Filtering , 2006, Int. J. Comput. Sci. Appl..

[8] Yehuda Koren,et al. The BellKor Solution to the Netflix Grand Prize , 2009 .