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

Restricted Boltzmann machineBoltzmann machineComputer scienceCollaborative filteringGraphical modelInferenceSet (abstract data type)Class (philosophy)Artificial intelligenceData setMachine learningLayer (electronics)Recommender systemData miningDeep learning

Affiliated Institutions

Related Publications

Publication Info

Year
2007
Type
article
Pages
791-798
Citations
1857
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

1857
OpenAlex

Cite This

Ruslan Salakhutdinov, Andriy Mnih, Geoffrey E. Hinton (2007). Restricted Boltzmann machines for collaborative filtering. , 791-798. https://doi.org/10.1145/1273496.1273596

Identifiers

DOI
10.1145/1273496.1273596