Restricted Boltzmann machines for collaborative filtering
Top Cited Papers
- 20 June 2007
- proceedings article
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 791-798
- https://doi.org/10.1145/1273496.1273596
Abstract
Most of the existing approaches to collaborative filtering cannot handle very large data sets. In this paper we show how a class of two-layer undirected graphical models, called Restricted Boltzmann Machines (RBM's), can be used to model tabular data, such as user's ratings of movies. We present efficient learning and inference procedures for this class of models and demonstrate that RBM's can be successfully applied to the Netflix data set, containing over 100 million user/movie ratings. We also show that RBM's slightly outperform carefully-tuned SVD models. When the predictions of multiple RBM models and multiple SVD models are linearly combined, we achieve an error rate that is well over 6% better than the score of Netflix's own system.Keywords
This publication has 7 references indexed in Scilit:
- Modeling Human Motion Using Binary Latent VariablesPublished by MIT Press ,2007
- Reducing the Dimensionality of Data with Neural NetworksScience, 2006
- A Fast Learning Algorithm for Deep Belief NetsNeural Computation, 2006
- The multiple multiplicative factor model for collaborative filteringPublished by Association for Computing Machinery (ACM) ,2004
- Collaborative filtering with privacy via factor analysisPublished by Association for Computing Machinery (ACM) ,2002
- Training Products of Experts by Minimizing Contrastive DivergenceNeural Computation, 2002
- Indexing by latent semantic analysisJournal of the American Society for Information Science, 1990