The Community for Technology Leaders
2008 IEEE International Conference on Data Mining Workshops (2008)
Dec. 15, 2008 to Dec. 19, 2008
ISBN: 978-0-7695-3503-6
pp: 553-562
ABSTRACT
Matrix Factorization (MF) based approaches have proven to be efficient for rating-based recommendation systems. In this work, we propose several matrix factorization approaches with improved prediction accuracy. We introduce a novel and fast (semi)-positive MF approach that approximates the features by using positive values for either users or items. We describe a momentum-based MF approach. A transductive version of MF is also introduced, which uses information from test instances (namely the ratings users have given for certain items)to improve prediction accuracy. We describe an incremental variant of MF that efficiently handles new users/ratings, which is crucial in a real-life recommender system. A hybrid MF--neighbor-based method is also discussed that further improves the performance of MF.The proposed methods are evaluated on the Netflix Prize dataset, and we show that they can achieve very favorable Quiz RMSE (best single method: 0.8904, combination: 0.8841) and running time.
INDEX TERMS
recommender systems, collaborative filtering, Netflix Prize, matrix factorization, neighbor-based methods, incremental gradient descent methods
CITATION

G. Takács, I. Pilászy, B. Németh and D. Tikk, "Investigation of Various Matrix Factorization Methods for Large Recommender Systems," 2008 IEEE International Conference on Data Mining Workshops(ICDMW), vol. 00, no. , pp. 553-562, 2008.
doi:10.1109/ICDMW.2008.86
86 ms
(Ver 3.3 (11022016))