CoChat

Discovering Binary Codes for Documents by Learning Deep Generative Models

Hinton, Geoffrey, Salakhutdinov, Ruslan · 2011 · Topics in Cognitive Science
Cited by 97

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

We describe a deep generative model in which the lowest layer represents the word‐count vector of a document and the top layer represents a learned binary code for that document. The top two layers of the generative model form an undirected associative memory and the remaining layers form a belief net with directed, top‐down connections. We present efficient learning and inference procedures for this type of generative model and show that it allows more accurate and much faster retrieval than latent semantic analysis. By using our method as a filter for a much slower method called TF‐IDF we achieve higher accuracy than TF‐IDF alone and save several orders of magnitude in retrieval time. By using short binary codes as addresses, we can perform retrieval on very large document sets in a time that is independent of the size of the document set using only one word of memory to describe each document.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1111/j.1756-8765.2010.01109.x

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • Training Products of Experts by Minimizing Contrastive Divergence

    Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879 · cited 4×

    “1 remains the same (Hinton, 2002): As all of the N softmax units share the same weights, we can drop the subscript on the v and write the learning rule as: where v m denotes the count for the m th word divided by N .”
    BackgroundMethodInfluentialSelf-citation
  • Semantic hashing

    Salakhutdinov, R., & Hinton, G. (2009) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2008.11.006 · Cited by 1,246 · cited 1×

    “We call this technique ‘‘semantic hashing’’ (Salakhutdinov & Hinton, 2007).”
    Self-citation

Show all 2 references

Cited by

See all 97

Metadata

Authors
Hinton, G., & Salakhutdinov, R.
Venue
Topics in Cognitive Science
Publisher
Wiley
Published
2010-08-18
Volume
3
Issue
1
Pages
74-91
ISSN
  • 1756-8757 (ISSN-L)
  • 1756-8765
OpenAlex
W2138806976
Cited by
97
References
2
FWCI
3.74
Type
journal article
Language
en
Open access
closed

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: Discovering Binary Codes for Documents by Learning Deep Generative Models. https://app.cochat.ai/papers/10.1111/j.1756-8765.2010.01109.x
The paper
Hinton, G., & Salakhutdinov, R. (2011). Discovering Binary Codes for Documents by Learning Deep Generative Models. Topics in Cognitive Science. https://doi.org/10.1111/j.1756-8765.2010.01109.x

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.