Cited by 2,403Data Management and AlgorithmsAdvanced Database Systems and QueriesAdvanced Image and Video Retrieval Techniques

When Is ''Nearest Neighbor'' Meaningful?

Beyer, Kevin, Goldstein, Jonathan, Ramakrishnan, Raghu, Shaft, Uri·1999·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/3-540-49257-7_15

Cites

30 of 30 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Overlap between adjacent clusters is expected in high-dimensional sparse voting data.

    “as expected in high-dimensional sparse voting data (Beyer et al., 1999).”

    From Benchmarking Overton Pluralism in LLMs (2025) · cites this paper as Beyer et al., 1999

Cites

Flagged first, then by citations

1 of the 31 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U.
Affiliations
University of Wisconsin–Madison (US)
Venue
Lecture Notes in Computer Science
Published
1999
Pages
217-235
ISSN
0302-9743 (ISSN-L)
OpenAlex
W1672197616
Cited by
2,403
References
31
Citations by year
2026: 67 · 2025: 84 · 2024: 86 · 2023: 82 · 2022: 81 · 2021: 102 · 2020: 112 · 2019: 128 · 2018: 112 · 2017: 99 · 2016: 117 · 2015: 110 · 2014: 119 · 2013: 127 · 2012: 115
FWCI
38.88
Type
conference paper
Language
en
Open access
closed
Locations
  • Lecture notes in computer science (publishedVersion)
  • Minds at UW (University of Wisconsin) (submittedVersion)
Funders
David and Lucile Packard Foundation
Topics
  • Physical Sciences › Computer Science › Signal Processing › Data Management and Algorithms
  • Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Database Systems and Queries
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
Keywords
nearest neighbor search, high-dimensional indexing, curse of dimensionality, nearest neighbor distance, linear scan

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