The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Locality-Sensitive Hashing for Finding Nearest Neighbors [Lecture Notes]
Abstract
This lecture note describes a technique known as locality-sensitive hashing (LSH) that allows one to quickly find similar entries in large databases. This approach belongs to a novel and interesting class of algorithms that are known as randomized algorithms. A randomized algorithm does not guarantee an exact answer but instead provides a high probability guarantee that it will return the correct answer or one close to it. By investing additional computational effort, the probability can be pushed as high as desired.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Syntactic clustering of the Web
Broder, A. Z., Glassman, S. C., Manasse, M. S., & Zweig, G. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00031-7 · Cited by 1,343
Fast pose estimation with parameter-sensitive hashing
Shakhnarovich, Viola, & Darrell (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238424 · Cited by 758
Nearest-Neighbor Methods in Learning and Vision: Theory and Practice
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/4908.001.0001 · Cited by 440
Nearest-neighbor methods in learning and vision : theory and practice
Shakhnarovich, G., Indyk, P., & Darrell, T. (2005) · Cited by 399
A review of algorithms for audio fingerprinting
Cano, P., Batlle, E., Kalker, T., & Haitsma, J. (2004) · IEEE International Workshop on Multimedia Signal Processing (MMSP) · doi:10.1109/mmsp.2002.1203274 · Cited by 253
Cited by
Multimodal Fusion with Recurrent Neural Networks for Rumor Detection on Microblogs
Jin, Z., Cao, J., Guo, H., Zhang, Y., & Luo, J. (2017) · Proceedings of the 25th ACM international conference on Multimedia · doi:10.1145/3123266.3123454 · Cited by 812
Scalable Graph-based Bug Search for Firmware Images
Feng, Q., Zhou, R., Xu, C., Cheng, Y., Testa, B., & Yin, H. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978370 · Cited by 401
Robust Image Hashing With Ring Partition and Invariant Vector Distance
Tang, Z., Zhang, X., Li, X., & Zhang, S. (2016) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2485163 · Cited by 247
Yang, D., Luo, S., Zhou, J., Pan, L., Yang, X., & Xing, J. (2023) · Information Sciences · doi:10.1016/j.ins.2023.119743 · Cited by 9
Metadata
- Authors
- Slaney, M., & Casey, M.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2008-03
- Volume
- 25
- Issue
- 2
- Pages
- 128-131
- ISSN
- 1053-5888 (ISSN-L)
- OpenAlex
- W2020498246
- Cited by
- 340
- References
- 6
- FWCI
- 10.98
- 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: Locality-Sensitive Hashing for Finding Nearest Neighbors [Lecture Notes]. https://app.cochat.ai/papers/10.1109/msp.2007.914237
- The paper
- Slaney, M., & Casey, M. (2008). Locality-Sensitive Hashing for Finding Nearest Neighbors [Lecture Notes]. IEEE Signal Processing Magazine. https://doi.org/10.1109/msp.2007.914237
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.