A study of mixture models for collaborative filtering

Collaborative filtering is a general technique for exploiting the preference patterns of a group of users to predict the utility of items for a particular user. Three different components need to be modeled in a collaborative filtering problem: users, items, and ratings. Previous research on applying probabilistic models to collaborative filtering has shown promising results. However, there is a lack of systematic studies of different ways to model each of the three components and their interactions. In this paper, we conduct a broad and systematic study on different mixture models for collaborative filtering. We discuss general issues related to using a mixture model for collaborative filtering, and propose three properties that a graphical model is expected to satisfy. Using these properties, we thoroughly examine five different mixture models, including Bayesian Clustering (BC), Aspect Model (AM), Flexible Mixture Model (FMM), Joint Mixture Model (JMM), and the Decoupled Model (DM). We compare these models both analytically and experimentally. Experiments over two datasets of movie ratings under different configurations show that in general, whether a model satisfies the proposed properties tends to be correlated with its performance. In particular, the Decoupled Model, which satisfies all the three desired properties, outperforms the other mixture models as well as many other existing approaches for collaborative filtering. Our study shows that graphical models are powerful tools for modeling collaborative filtering, but careful design is necessary to achieve good performance.

[1]  John Riedl,et al.  GroupLens: an open architecture for collaborative filtering of netnews , 1994, CSCW '94.

[2]  Peter Haddawy,et al.  Toward Case-Based Preference Elicitation: Similarity Measures on Preference Structures , 1998, UAI.

[3]  Luo Si,et al.  Flexible Mixture Model for Collaborative Filtering , 2003, ICML.

[4]  Yoram Singer,et al.  An Efficient Boosting Algorithm for Combining Preferences by , 2013 .

[5]  Luo Si,et al.  Preference-based Graphic Models for Collaborative Filtering , 2002, UAI.

[6]  Gerard Salton,et al.  Research and Development in Information Retrieval , 1982, Lecture Notes in Computer Science.

[7]  Yoram Singer,et al.  Learning to Order Things , 1997, NIPS.

[8]  David Heckerman,et al.  Empirical Analysis of Predictive Algorithms for Collaborative Filtering , 1998, UAI.

[9]  Raymond J. Mooney,et al.  Content-boosted collaborative filtering for improved recommendations , 2002, AAAI/IAAI.

[10]  Jonathan L. Herlocker,et al.  Clustering items for collaborative filtering , 1999 .

[11]  David M. Pennock,et al.  Probabilistic Models for Unified Collaborative and Content-Based Recommendation in Sparse-Data Environments , 2001, UAI.

[12]  Richard S. Zemel,et al.  Multiple Cause Vector Quantization , 2002, NIPS.

[13]  Richard W. Vuduc,et al.  SWAMI (poster session): a framework for collaborative filtering algorithm development and evaluation , 2000, SIGIR '00.

[14]  Mark W. Newman,et al.  SWAMI: a framework for collaborative filtering algorithm development and evaluation. , 2000, SIGIR 2000.

[15]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[16]  Naonori Ueda,et al.  Deterministic annealing EM algorithm , 1998, Neural Networks.

[17]  Eric Horvitz,et al.  Collaborative Filtering by Personality Diagnosis: A Hybrid Memory and Model-Based Approach , 2000, UAI.

[18]  Eric Horvitz,et al.  Collaborative filtering by personality diagnosis , 2000, UAI 2000.

[19]  Thomas Hofmann,et al.  Statistical Models for Co-occurrence Data , 1998 .

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

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

[22]  John Riedl,et al.  An algorithmic framework for performing collaborative filtering , 1999, SIGIR '99.