Modeling item selection and relevance for accurate recommendations: a bayesian approach

We propose a bayesian probabilistic model for explicit preference data. The model introduces a generative process, which takes into account both item selection and rating emission to gather into communities those users who experience the same items and tend to adopt the same rating pattern. Each user is modeled as a random mixture of topics, where each topic is characterized by a distribution modeling the popularity of items within the respective user-community and by a distribution over preference values for those items. The proposed model can be associated with a novel item-relevance ranking criterion, which is based both on item popularity and user's preferences. We show that the proposed model, equipped with the new ranking criterion, outperforms state-of-art approaches in terms of accuracy of the recommendation list provided to users on standard benchmark datasets.

[1]  Roberto Turrin,et al.  Performance of recommender algorithms on top-n recommendation tasks , 2010, RecSys '10.

[2]  T. Minka Estimating a Dirichlet distribution , 2012 .

[3]  Benjamin M. Marlin,et al.  Collaborative Filtering: A Machine Learning Perspective , 2004 .

[4]  Christopher M. Bishop,et al.  Pattern Recognition and Machine Learning (Information Science and Statistics) , 2006 .

[5]  Deepak Agarwal,et al.  fLDA: matrix factorization through latent dirichlet allocation , 2010, WSDM '10.

[6]  Benjamin M. Marlin,et al.  Modeling User Rating Profiles For Collaborative Filtering , 2003, NIPS.

[7]  Thomas Hofmann,et al.  Collaborative filtering via gaussian probabilistic latent semantic analysis , 2003, SIGIR.

[8]  Thore Graepel,et al.  Matchbox: large scale online bayesian recommendations , 2009, WWW '09.

[9]  Radford M. Neal Pattern Recognition and Machine Learning , 2007, Technometrics.

[10]  Nicola Barbieri,et al.  Regularized Gibbs Sampling for User Profiling with Soft Constraints , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[11]  Ruslan Salakhutdinov,et al.  Probabilistic Matrix Factorization , 2007, NIPS.

[12]  Nicola Barbieri,et al.  An Analysis of Probabilistic Methods for Top-N Recommendation in Collaborative Filtering , 2011, ECML/PKDD.

[13]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[14]  Thomas Hofmann,et al.  Latent Class Models for Collaborative Filtering , 1999, IJCAI.

[15]  Nicola Barbieri,et al.  A Probabilistic Hierarchical Approach for Pattern Discovery in Collaborative Filtering Data (Extended Abstract) , 2011, SEBD.

[16]  Thomas Hofmann,et al.  Latent semantic models for collaborative filtering , 2004, TOIS.

[17]  Gregor Heinrich Parameter estimation for text analysis , 2009 .

[18]  Xin Jin,et al.  A maximum entropy web recommendation system: combining collaborative and content features , 2005, KDD '05.