ABSTRACT
A fundamental aspect of rating-based recommender systems is the observation process, the process by which users choose the items they rate. Nearly all research on collaborative filtering and recommender systems is founded on the assumption that missing ratings are missing at random. The statistical theory of missing data shows that incorrect assumptions about missing data can lead to biased parameter estimation and prediction. In a recent study, we demonstrated strong evidence for violations of the missing at random condition in a real recommender system. In this paper we present the first study of the effect of non-random missing data on collaborative ranking, and extend our previous results regarding the impact of non-random missing data on collaborative prediction.
- J. S. Breese, D. Heckerman, and C. Kadie. Empirical Analysis of Predictive Algorithms for Collaborative Filtering. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pages 43--52, 1998. Google ScholarDigital Library
- D. Decoste. Collaborative prediction using ensembles of maximum margin matrix factorizations. In Proceedings of the 23rd International Conference on Machine Learning, pages 249--256, 2006. Google ScholarDigital Library
- A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39(1):1--38, 1977.Google Scholar
- J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl. An algorithmic framework for performing collaborative filtering. In Proceedings of the 22nd ACM SIGIR Conference, pages 230--237, 1999. Google ScholarDigital Library
- J. L. Herlocker, J. A. Konstan, and J. Riedl. Explaining collaborative filtering recommendations. In Proceedings of the 2000 ACM conference on Computer supported cooperative work, pages 241--250, 2000. Google ScholarDigital Library
- R. J. A. Little and D. B. Rubin. Statistical Analysis with Missing Data. John Wiley and Sons, Inc., 1987. Google ScholarDigital Library
- B. Marlin. Missing Data Problems in Machine Learning. PhD thesis, University of Toronto, April 2008. Google ScholarDigital Library
- B. Marlin, R. Zemel, S. Roweis, and M. Slaney. Collaborative filtering and the missing at random assumption. In Uncertainty in Artificial Intelligence 23, 2007.Google Scholar
- J. Nocedal and S. J. Wright. Numerical Optimization. Springer, 1999.Google ScholarCross Ref
- R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In Advances in Neural Information Processing Systems, volume 20, 2008.Google ScholarDigital Library
- R. Salakhutdinov, A. Mnih, and G. Hinton. Restricted boltzmann machines for collaborative filtering. In Proceedings of the 24th International Conference on Machine Learning, pages 249--256, 2007. Google ScholarDigital Library
- B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. Item-based collaborative filtering recommendation algorithms. In Proceedings of the 10th international conference on World Wide Web, pages 285--295, New York, NY, USA, 2001. ACM. Google ScholarDigital Library
- G. Takacs, I. Pilaszy, B. Nemeth, and D. Tikk. Matrix factorization and neighbor based algorithms for the netflix prize problem. In Proceedings of the 2008 ACM conference on Recommender systems, pages 267--274, 2008. Google ScholarDigital Library
- M. Weimer, A. Karatzoglou, Q. Le, and A. Smola. Cofi rank -- maximum margin matrix factorization for collaborative ranking. In Advances in Neural Information Processing Systems 20, pages 1593--1600, 2008.Google Scholar
- M. Weimer, A. Karatzoglou, and A. Smola. Adaptive collaborative filtering. In Proceedings of the 2008 ACM conference on Recommender systems, pages 275--282, 2008. Google ScholarDigital Library
Index Terms
Collaborative prediction and ranking with non-random missing data
Recommendations
Bayesian binomial mixture model for collaborative prediction with non-random missing data
RecSys '14: Proceedings of the 8th ACM Conference on Recommender systemsCollaborative prediction involves filling in missing entries of a user-item matrix to predict preferences of users based on their observed preferences. Most of existing models assume that the data is missing at random (MAR), which is often violated in ...
Unifying rating-oriented and ranking-oriented collaborative filtering for improved recommendation
We propose a novel unified recommendation model, URM, which combines a rating-oriented collaborative filtering (CF) approach, i.e., probabilistic matrix factorization (PMF), and a ranking-oriented CF approach, i.e., list-wise learning-to-rank with ...
Collaborative filtering based on an iterative prediction method to alleviate the sparsity problem
iiWAS '09: Proceedings of the 11th International Conference on Information Integration and Web-based Applications & ServicesCollaborative filtering (CF) is one of the most popular recommender system technologies. It tries to identify users that have relevant interests and preferences by calculating similarities among user profiles. The idea behind this method is that, it may ...
Comments