Recommending new movies: even a few ratings are more valuable than metadata

ABSTRACT

The Netflix Prize (NP) competition gave much attention to collaborative filtering (CF) approaches. Matrix factorization (MF) based CF approaches assign low dimensional feature vectors to users and items. We link CF and content-based filtering (CBF) by finding a linear transformation that transforms user or item descriptions so that they are as close as possible to the feature vectors generated by MF for CF. We propose methods for explicit feedback that are able to handle 140,000 features when feature vectors are very sparse. With movie metadata collected for the NP movies we show that the prediction performance of the methods is comparable to that of CF, and can be used to predict user preferences on new movies. We also investigate the value of movie metadata compared to movie ratings in regards of predictive power. We compare our solely CBF approach with a simple baseline rating-based predictor. We show that even 10 ratings of a new movie are more valuable than its metadata for predicting user ratings.

REFERENCES

• 1: J. Basilico and T. Hofmann. Unifying collaborative and content-based filtering. In ICML-04: Proc. of the 21st Int. Conf. on Machine learning, page 9, New York, NY, USA, 2004.
• 2: R. M. Bell and Y. Koren. Improved neighborhood-based collaborative filtering. In Proc. of KDD Cup Workshop at SIGKDD-07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 7--14, San Jose, California, USA, 2007.
• 3: R. M. Bell and Y. Koren. Scalable collaborative filtering with jointly derived neighborhood interpolation weights. In Proc of. ICDM-07, 7th IEEE Int. Conf. on Data Mining, pages 43--52, Omaha, Nebraska, USA, 2007.
• 4: R. M. Bell, Y. Koren, and C. Volinsky. The BellKor solution to the Netflix Prize. Technical Report, AT&T Labs Research, 2007.
• 5: Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In Proc. of ICDM-08, 8th IEEE Int. Conf. on Data Mining, pages 263--272, Pisa, Italy, 2008.
• 6: A. Paterek. Improving regularized singular value decomposition for collaborative filtering. In Proc. of KDD Cup Workshop at SIGKDD-07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 39--42, San Jose, California, USA, 2007.
• 7: A. P. Singh and G. J. Gordon. Relational learning via collective matrix factorization. In KDD-08: Proc. of the 14$^th$ ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, 2008.
• 8: G. Takács, I. Pilászy, B. Németh, and D. Tikk. On the Gravity recommendation system. In Proc. of KDD Cup Workshop at SIGKDD-07, 13th ACM Int. Conf. on Knowledge Discovery and Data Mining, pages 22--30, San Jose, California, USA, 2007.
• 9: G. Takács, I. Pilászy, B. Németh, and D. Tikk. A unified approach of factor models and neighbor based methods for large recommender systems. In Proc. of ICADIWT-08, 1st IEEE Workshop on Recommender Systems and Personalized Retrieval, pages 186--191, August 2008.
• 10: G. Takács, I. Pilászy, B. Németh, and D. Tikk. Scalable collaborative filtering approaches for large recommender systems. Journal of Machine Learning Research, 10:623--656, 2009.
• 11: G. Takács, I. Pilászy, B. Németh, and D. Tikk. Investigation of various matrix factorization methods for large recommender systems. In Proc. of the 2nd Netflix-KDD Workshop, Las Vegas, NV, USA, August 24, 2008.
• 12: Y. Zhang and J. Koren. Efficient Bayesian hierarchical user modeling for recommendation system. In SIGIR-07: Proc. of the 30th Annual Int. ACM SIGIR Conference on R&D in Information Retrieval, pages 47--54, New York, NY, USA, 2007.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.6 Learning
          Subjects: Parameter learning

General Terms:
Algorithms, Experimentation

Keywords:
NSVD1, Netflix prize, RMSE, collaborative filtering, content-based filtering, matrix factorization