Two-Way Grouping by One-Way Topic Models

We tackle the problem of new users or documents in collaborative filtering. Generalization over users by grouping them into user groups is beneficial when a rating is to be predicted for a relatively new document having only few observed ratings. The same applies for documents in the case of new users. We have shown earlier that if there are both new users and new documents, two-way generalization becomes necessary, and introduced a probabilistic Two-Way Model for the task. The task of finding a two-way grouping is a non-trivial combinatorial problem, which makes it computationally difficult. We suggest approximating the Two-Way Model with two URP models; one that groups users and one that groups documents. Their two predictions are combined using a product of experts model. This combination of two one-way models achieves even better prediction performance than the original Two-Way Model.

[1]  Andrew McCallum,et al.  The Author-Recipient-Topic Model for Topic and Role Discovery in Social Networks: Experiments with Enron and Academic Email , 2005 .

[2]  Tapio Elomaa,et al.  Machine Learning: ECML 2002 , 2002, Lecture Notes in Computer Science.

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

[4]  Samy Bengio,et al.  Theme Topic Mixture Model: A Graphical Model for Document Representation , 2004 .

[5]  Anh Duc Duong,et al.  Addressing cold-start problem in recommendation systems , 2008, ICUIMC '08.

[6]  Richard S. Zemel,et al.  The multiple multiplicative factor model for collaborative filtering , 2004, ICML.

[7]  Geoffrey E. Hinton Training Products of Experts by Minimizing Contrastive Divergence , 2002, Neural Computation.

[8]  Marko Grobelnik,et al.  Subspace, Latent Structure and Feature Selection, Statistical and Optimization, Perspectives Workshop, SLSFS 2005, Bohinj, Slovenia, February 23-25, 2005, Revised Selected Papers , 2006, SLSFS.

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

[10]  Volker Tresp,et al.  Dirichlet Enhanced Latent Semantic Analysis , 2005, AISTATS.

[11]  Bradley N. Miller,et al.  GroupLens: applying collaborative filtering to Usenet news , 1997, CACM.

[12]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[13]  Samuel Kaski,et al.  Latent grouping models for user preference prediction , 2008, Machine Learning.

[14]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[15]  Samuel Kaski,et al.  Two-Way Latent Grouping Model for User Preference Prediction , 2005, UAI.

[16]  Gemma C. Garriga,et al.  An approximation ratio for biclustering , 2008, Inf. Process. Lett..

[17]  Henry Tirri,et al.  Bayesian analysis of online newspaper log data , 2003, 2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings..

[18]  Anoop Sarkar,et al.  Proceedings of the Twentieth International Conference on Machine Learning (ICML-2003) , 2003 .

[19]  Michael I. Jordan,et al.  Modeling annotated data , 2003, SIGIR.

[20]  Pattie Maes,et al.  Social information filtering: algorithms for automating “word of mouth” , 1995, CHI '95.

[21]  Thomas L. Griffiths,et al.  The Author-Topic Model for Authors and Documents , 2004, UAI.

[22]  P. Donnelly,et al.  Inference of population structure using multilocus genotype data. , 2000, Genetics.

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

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

[25]  Marko Grobelnik,et al.  Subspace, Latent Structure and Feature Selection techniques , 2006 .

[26]  Luís Torgo,et al.  Knowledge Discovery in Databases: PKDD 2005, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, October 3-7, 2005, Proceedings , 2005, PKDD.

[27]  Takeo Kanade,et al.  Maximum Entropy for Collaborative Filtering , 2004, UAI.

[28]  Stan Matwin,et al.  Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases , 2007 .

[29]  Samuel Kaski,et al.  Using dependencies to pair samples for multi-view learning , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[30]  J. Lafferty,et al.  Mixed-membership models of scientific publications , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[31]  M. Stephens,et al.  Inference of population structure using multilocus genotype data: dominant markers and null alleles , 2007, Molecular ecology notes.

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

[33]  Aleks Jakulin,et al.  Discrete Component Analysis , 2005, SLSFS.

[34]  Luo Si,et al.  A Bayesian Approach toward Active Learning for Collaborative Filtering , 2004, UAI.

[35]  Wray L. Buntine Variational Extensions to EM and Multinomial PCA , 2002, ECML.

[36]  Anirban Dasgupta,et al.  Approximation algorithms for co-clustering , 2008, PODS.

[37]  Henry Tirri,et al.  The 2003 Symposium on Applications and the Internet Workshops, SAINT 2003 Workshops, Los Alamitos, California 2003 , 2003 .

[38]  Hans-Peter Kriegel,et al.  A Probabilistic Clustering-Projection Model for Discrete Data , 2005, PKDD.