Restricted Boltzmann Machines for Collaborative Filtering
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.
Cite
Text
Salakhutdinov et al. "Restricted Boltzmann Machines for Collaborative Filtering." International Conference on Machine Learning, 2007. doi:10.1145/1273496.1273596Markdown
[Salakhutdinov et al. "Restricted Boltzmann Machines for Collaborative Filtering." International Conference on Machine Learning, 2007.](https://mlanthology.org/icml/2007/salakhutdinov2007icml-restricted/) doi:10.1145/1273496.1273596BibTeX
@inproceedings{salakhutdinov2007icml-restricted,
title = {{Restricted Boltzmann Machines for Collaborative Filtering}},
author = {Salakhutdinov, Ruslan and Mnih, Andriy and Hinton, Geoffrey E.},
booktitle = {International Conference on Machine Learning},
year = {2007},
pages = {791-798},
doi = {10.1145/1273496.1273596},
url = {https://mlanthology.org/icml/2007/salakhutdinov2007icml-restricted/}
}