Matrix factorization and neighbor based algorithms for the netflix prize problem

Publication Name: Recsys 08 Proceedings of the 2008 ACM Conference on Recommender Systems

Publication Date: 2008-12-01

Volume: Unknown

Issue: Unknown

Page Range: 267-274

Description:

Collaborative filtering (CF) approaches proved to be effective for recommender systems in predicting user preferences in item selection using known user ratings of items. This subfield of machine learning has gained a lot of popularity with the Netix Prize competition started in October 2006. Two major approaches for this problem are matrix factorization (MF) and the neighbor based approach (NB). In this work, we propose various variants of MF and NB that can boost the performance of the usual ensemble based scheme. First, we investigate various regularization scenarios for MF. Second, we introduce two NB methods: one is based on correlation coeficients and the other on linear least squares. At the experimentation part, we show that the proposed approaches compare favorably with existing ones in terms of prediction accuracy and/or required training time. We present results of blending the proposed methods. © 2008 ACM.

Open Access: Yes

DOI: 10.1145/1454008.1454049

Authors - 4