skip to main content
research-article

A study of mixture models for collaborative filtering

Published: 01 June 2006 Publication History

Abstract

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.

References

[1]
Breese JS, Heckerman D and Kadie C (1998) Empirical analysis of predictive algorithms for collaborative filtering. In the Proceeding of the Fourteenth Conference on Uncertainty in Artificial Intelligence
[2]
Cohen W, Shapire R, and Singer Y Learning to order things Advances in Neural Processing Systems 10 1998 Denver, CO MIT Press 1997
[3]
Connor M and Herlocker J (2001) Clustering items for collaborative filtering. In the Proceedings of SIGIR-2001 Workshop on Recommender Systems, New Orleans, LA
[4]
Dempster AP, Laird NM, and Rubin DB Maximum likelihood from incomplete data via the EM algorithm Journal of the Royal Statistical Society 1977 B39 1-38
[5]
Fisher D, Hildrum K, Hong J, Newman M and Vuduc R (2000) SWAMI: A framework for collaborative filtering algorithm development and evaluation. In the Proceedings of the 23rd Annual International Conference on Research and Development in Information Retrieval (SIGIR)
[6]
Freund Y, Iyer R, Shapire R and Singer Y (1998) An efficient boosting algorithm for combining preferences. In Proceedings of ICML 1998
[7]
Ha V and Haddawy P (1998) Toward case-based preference elicitation: Similarity measures on preference structures. In: Proceedings of UAI 1998
[8]
Herlocker JL, Konstan JA, Brochers A and Riedl J (1999) An algorithm framework for performing collaborative filtering. In: Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR)
[9]
Hofmann T and Puzicha J (1999) Latent class models for collaborative filtering. In: Proceedings of International Joint Conference on Artificial Intelligence 1999
[10]
Hofmann T and Puzicha J (1998) Statistical models for co-occurrence data (Technical report). Artificial Intelligence Laboratory Memo 1625, M.I.T
[11]
Hofmann T (2003) Gaussian latent semantic models for collaborative filtering. In: Proceedings of the 26th Annual International ACM SIGIR Conference
[12]
Jin R, Si L and Zhai CX (2003) Preference-based graphical models for collaborative filtering. In: Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI)
[13]
Melville P, Mooney RJ and Nagarajan R (2002) Content-boosted collaborative filtering for improved recommendations. In the Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI)
[14]
Pennock DM, Horvitz E, Lawrence S and Giles CL (2000) Collaborative filtering by personality diagnosis: A hybrid memory- and model-based approach. In the Proceeding of the Sixteenth Conference on Uncertainty in Artificial Intelligence
[15]
Popescul A Ungar LH Pennock DM and Lawrence S (2001) Probabilistic models for unified collaborative and content-based recommendation in sparse-data environments. In: Proceeding of the Seventeenth Conference on Uncertainty in Artificial Intelligence
[16]
Resnick P, Iacovou N, Suchak M, Bergstrom P and Riedl J (1994) Grouplens: An open architecture for collaborative filtering of netnews. In Proceeding of the ACM 1994 Conference on Computer Supported Cooperative Work
[17]
Ross DA and Zemel RS (2002) Multiple-cause vector quantization. In NIPS-15: Advances in Neural Information Processing Systems 15
[18]
Si L and Jin R (2003) Product space mixture model for collaborative filtering. In: Proceedings of the Twentieth International Conference on Machine Learning (ICML)
[19]
Ueda N and Nakano R Deterministic annealing EM algorithm Neural Networks 1998 11 2 271-282

Cited By

View all

Index Terms

  1. A study of mixture models for collaborative filtering
          Index terms have been assigned to the content through auto-classification.

          Recommendations

          Reviews

          Hsun Chang

          The development of a good way to retrieve useful information on the Internet is an important area of study. Collaborative filtering is one type of information retrieval scheme. It relies on the existing ratings of users to provide user recommendations. One important method in collaborative filtering is to describe users, items, and ratings with statistical models. When a test user comes along, the system automatically predicts the user's fit with the items and ratings. Existing methods model users and items together, and consider ratings to be users' preferences. This paper proposes a more faithful model that describes the users and the items separately. In addition, users' ratings might not capture their preferences exactly, so this paper decouples user preferences from rating patterns. The authors adopt probabilistic graph models to describe the relations among users, items, and ratings. The experimental results show the superiority of the proposed approach over other existing methods. Good performance is not a surprise, because the authors' method describes the real world in greater detail than other methods. This paper proposes the use of a more flexible model to capture the practical world. The proposed ideas are reasonable, and the results are superior. Although the proposed method increases computational complexity, it is crucial to obtain more accurate results. Online Computing Reviews Service

          Access critical reviews of Computing literature here

          Become a reviewer for Computing Reviews.

          Comments

          Information & Contributors

          Information

          Published In

          cover image Information Retrieval
          Information Retrieval  Volume 9, Issue 3
          Jun 2006
          157 pages

          Publisher

          Kluwer Academic Publishers

          United States

          Publication History

          Published: 01 June 2006
          Accepted: 29 August 2005
          Revision received: 01 May 2005
          Received: 20 July 2004

          Author Tags

          1. Collaborative filtering
          2. Graphical model
          3. Probabilistic model

          Qualifiers

          • Research-article

          Contributors

          Other Metrics

          Bibliometrics & Citations

          Bibliometrics

          Article Metrics

          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)0
          Reflects downloads up to 06 Jan 2025

          Other Metrics

          Citations

          Cited By

          View all

          View Options

          View options

          Media

          Figures

          Other

          Tables

          Share

          Share

          Share this Publication link

          Share on social media