ABSTRACT
We present a probabilistic model for generating personalised recommendations of items to users of a web service. The Matchbox system makes use of content information in the form of user and item meta data in combination with collaborative filtering information from previous user behavior in order to predict the value of an item for a user. Users and items are represented by feature vectors which are mapped into a low-dimensional `trait space' in which similarity is measured in terms of inner products. The model can be trained from different types of feedback in order to learn user-item preferences. Here we present three alternatives: direct observation of an absolute rating each user gives to some items, observation of a binary preference (like/ don't like) and observation of a set of ordinal ratings on a user-specific scale. Efficient inference is achieved by approximate message passing involving a combination of Expectation Propagation (EP) and Variational Message Passing. We also include a dynamics model which allows an item's popularity, a user's taste or a user's personal rating scale to drift over time. By using Assumed-Density Filtering (ADF) for training, the model requires only a single pass through the training data. This is an on-line learning algorithm capable of incrementally taking account of new data so the system can immediately reflect the latest user preferences. We evaluate the performance of the algorithm on the MovieLens and Netflix data sets consisting of approximately 1,000,000 and 100,000,000 ratings respectively. This demonstrates that training the model using the on-line ADF approach yields state-of-the-art performance with the option of improving performance further if computational resources are available by performing multiple EP passes over the training data.
- Netflix Cinematch: http://www.netflix.com.Google Scholar
- R. M. Bell and Y. Koren. Lessons from the Netflix prize challenge. ACM SIGKDD Explorations Newsletter, 9:75--79, 2007. Google ScholarDigital Library
- J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the 14th ACM Conference on Uncertainty in Artificial Intelligence, pages 34--52, 1998. Google ScholarDigital Library
- W. Chu and Z. Ghahramani. Gaussian processes for ordinal regression. pages 1019--1041, 2005. Google ScholarDigital Library
- P. Dangauthier, R. Herbrich, T. Minka, and T. Graepel. Trueskill through time: Revisiting the history of chess. In Advances in Neural Information Processing Systems 20, pages 337--344, 2008.Google Scholar
- Abhinandan S. Das, Mayur Datar, Ashutosh Garg, and Shyam Rajaram. Google news personalization: scalable online collaborative filtering. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 271--280, New York, NY, USA, 2007. ACM Press. Google ScholarDigital Library
- D. N. Goldberg, B. M. Oki, and D. Terry. Using collaborative filtering to weave an information tapestry. Communications of the ACM, 35:61--70, 1992. Google ScholarDigital Library
- R. Herbrich, T. Minka, and T. Graepel. TrueSkill(TM): A Bayesian skill rating system. In Advances in Neural Information Processing Systems 20, pages 569--576, 2007.Google Scholar
- M. K. Hughey and M. W. Berry. Improved query matching using kd--trees: A latent semantic indexing enhancement. Information Retrieval, 2:287--302, 2004. Google ScholarDigital Library
- F. R. Kschischang, B. Frey, and H.-A. Loeliger. Factor graphs and the sum--product algorithm. IEEE Trans. Inform. Theory, 47(2):498--519, 2001. Google ScholarDigital Library
- X. N. Lam, T. Vu, T. D. Le, and A. D. Duong. Addressing cold-start problem in recommendation systems. In Proceedings of the 2nd international conference on Ubiquitous information management and communication, pages 208--211, 2008. Google ScholarDigital Library
- Y. J. Lim and Y. W. Teh. Variational Bayesian approach to movie rating prediction. In Proceedings of KDD Cup and Workshop, 2007.Google Scholar
- Benjamin Marlin. Collaborative filtering: A machine learning perspective. Master's thesis, University of Toronto, 2004.Google Scholar
- T. Minka. Divergence measures and message passing. Technical Report MSR-TR-2007-173, Microsoft Research Ltd., 2005.Google Scholar
- T. Minka, J.M. Winn, J.P. Guiver, and A. Kannan. Infer.NET 2.2, 2009. Microsoft Research Cambridge. http://research.microsoft.com/infernet.Google Scholar
- Thomas Minka. A family of algorithms for approximate Bayesian inference. PhD thesis, MIT, 2001. Google ScholarDigital Library
- A. Mnih R. Salakhutdinov and G. Hinton. Restricted Boltzmann machines for collaborative filtering. In Proceedings of the 24th Annual International Conference on Machine Learning, pages 791--798, 2007. Google ScholarDigital Library
- J. B. Schafer, J. Konstan, and J. Riedi. Recommender systems in E-commerce. In Proceedings of the 1st ACM conference on Electronic commerce, pages 158--166, 1999. Google ScholarDigital Library
- H. R. Varian and P. Resnick. Recommender systems. Communications of the ACM, 40:56--58, 1997. Google ScholarDigital Library
- J. M. Winn. Variational message passing and its application. PhD thesis, Department of Physics, University of Cambridge, 2003.Google Scholar
Index Terms
- Matchbox: large scale online bayesian recommendations
Recommendations
Improving Accuracy of Recommender System by Item Clustering
Recommender System (RS) predicts user's ratings towards items, and then recommends highly-predicted items to user. In recent years, RS has been playing more and more important role in the agent research field. There have been a great deal of researches ...
An Improved Collaborative Filtering Model Considering Item Similarity
ISCC-C '13: Proceedings of the 2013 International Conference on Information Science and Cloud Computing CompanionBecause of its simplicity and effectiveness, collaborative filtering (CF) became one of the most successful recommendation algorithms. User-based CF is one classic method of CF algorithms. In order to solve the problem that common rating items are often ...
A Collaborative Filtering Recommendation Algorithm Based on Item Classification
PACCS '09: Proceedings of the 2009 Pacific-Asia Conference on Circuits, Communications and SystemsCollaborative filtering systems represent services of personalized that aim at predicting a user’s interest on some items available in the application systems. With the development of electronic commerce, the number of users and items grows rapidly, ...
Comments