Restricted Boltzmann machines for collaborative filtering
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Zhou et al. [13] mainly focused on the deep learning model training and inference with edge computing.”
From Deep learning for edge computing applications: A State-of-the-Art survey (2020) · cites this paper as [13]
Citations
Cites
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
Self-citationA fast learning algorithm for deep belief nets
Hinton, G. E., Osindero, S., & Teh, Y.-W. (2006) · Neural Computation · doi:10.1162/neco.2006.18.7.1527 · Cited by 16,336
Self-citationIndexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Training Products of Experts by Minimizing Contrastive Divergence
Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879 · cited 4×
“Each hidden unit could then learn to model a signi(cid:12)cant dependency between the ratings of di(cid:11)erent movies.”
BackgroundMethodInfluentialSelf-citationProbabilistic Latent Semantic Analysis
Hofmann, T. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6705 · Cited by 2,047
Maximum-Margin Matrix Factorization
Srebro, N., Rennie, J. D. M., & Jaakkola, T. (2004) · Cited by 962
Weighted low-rank approximations
Srebro, N., & Jaakkola, T. (2003) · International Conference on Machine Learning · Cited by 715
Modeling Human Motion Using Binary Latent Variables
Taylor, G. W., Hinton, G. E., & Roweis, S. T. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0173 · Cited by 689
Self-citationOn Contrastive Divergence Learning.
Carreira-Perpiñán, M. Á., & Hinton, G. E. (2005) · Cited by 630
Self-citationCollaborative filtering with privacy via factor analysis
Canny, J. (2002) · Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/564376.564419 · Cited by 508
Research works printed but not linked: 3
- Hofmann T., 1999, Proceedings of the 15th Conference on Uncertainty in AI (pp. 289--296)
- Srebro N., 2003, Proceedings of the Twentieth International Conference (ICML 2003
- Sutskever I., 2006, echnical Report UTML TR 2006-003). Dept. of Computer Science
Cited by
(2010) · International Conference on Machine Learning · Cited by 13,995
Self-citationRepresentation Learning: A Review and New Perspectives
Bengio, Y., Courville, A., & Vincent, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.50 · Cited by 13,001
Neural Collaborative Filtering
He, X., Liao, L., Zhang, H., Nie, L., Hu, X., & Chua, T.-S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052569 · Cited by 6,652
Bengio, Y., Louradour, J., Collobert, R., & Weston, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553380 · Cited by 5,366
Learning Deep Architectures for AI
Bengio, Y. (2009) · now publishers, Inc. eBooks · doi:10.1561/9781601982957 · Cited by 4,941
Metadata
- Authors
- Salakhutdinov, R., Mnih, A., & Hinton, G.
- Affiliations
- University of Toronto (CA)
- Venue
- Proceedings of the 24th international conference on Machine learning
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 791-798
- OpenAlex
- W2099866409
- Cited by
- 1,885
- References
- 15
- Citations by year
- 2026: 20 · 2025: 41 · 2024: 63 · 2023: 82 · 2022: 120 · 2021: 164 · 2020: 194 · 2019: 222 · 2018: 210 · 2017: 193 · 2016: 149 · 2015: 89 · 2014: 93 · 2013: 53 · 2012: 42
- FWCI
- 27.13
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Machine Learning (publishedVersion)
- UCL Discovery (University College London) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
- Keywords
- restricted Boltzmann machine, collaborative filtering, recommender systems, undirected graphical models, matrix factorization, singular value decomposition, Netflix Prize, ensemble forecasting, large-scale data
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Restricted Boltzmann machines for collaborative filtering. https://app.cochat.ai/papers/10.1145/1273496.1273596
- The paper
- Salakhutdinov, R., Mnih, A., & Hinton, G. (2007). Restricted Boltzmann machines for collaborative filtering. Proceedings of the 24th international conference on Machine learning. https://doi.org/10.1145/1273496.1273596
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.