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.
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- R. M. Bell, Y. Koren, and C. Volinsky. The BellKor solution to the Netflix Prize. Technical Report, AT&T Labs Research, 2007.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
- Recommending new movies: even a few ratings are more valuable than metadata
Recommendations
Matrix factorization and neighbor based algorithms for the netflix prize problem
RecSys '08: Proceedings of the 2008 ACM conference on Recommender systemsCollaborative 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 Netflix ...
A Scalable, Accurate Hybrid Recommender System
WKDD '10: Proceedings of the 2010 Third International Conference on Knowledge Discovery and Data MiningRecommender systems apply machine learning techniques for filtering unseen information and can predict whether a user would like a given resource. There are three main types of recommender systems: collaborative filtering, content-based filtering, and ...
Investigation of various matrix factorization methods for large recommender systems
NETFLIX '08: Proceedings of the 2nd KDD Workshop on Large-Scale Recommender Systems and the Netflix Prize CompetitionMatrix 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)-...
Comments