Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 2,813

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

An Algorithm for Finding Best Matches in Logarithmic Expected Time

Friedman, Jerome H., Bentley, Jon Louis, Finkel, Raphael Ari · 1977 · ACM Transactions on Mathematical Software

Abstract

An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record. The computation required to organize the file is proportional to kNlogN. The expected number of records examined in each search is independent of the file size. The expected computation to perform each search is proportional-to 1ogN. Empirical evidence suggests that except for very small files, this algorithm is considerably faster than other methods.

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.1145/355744.355745

Cites

10 of 10 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

Research works printed but not linked: 2

  1. PIZER , S.M. Numerical Computing and Mathematical Analysis , Science Research Associates , Chicago, Ill ., 1975 , p. 88, eq. 87. PIZER, S.M. Numerical Computing and Mathematical Analysis, Science Research Associates, Chicago, Ill., 1975, p. 88, eq. 87.
  2. SHAMOS , M.I. Geometric Complexity. Conf. Rec. Seventh Annual ACM Syrup. on Theory of Comptng , Albuquerque, N.Mex. , May 1975 , 224 - 233 . 10.1145/800116.803772 SHAMOS, M.I. Geometric Complexity. Conf. Rec. Seventh Annual ACM Syrup. on Theory of Comptng, Albuquerque, N.Mex., May 1975, 224-233. 10.1145/800116.803772 · doi:10.1145/800116.803772

Cited by

See all 2,813

Metadata

Authors
Friedman, J. H., Bentley, J. L., & Finkel, R. A.
Venue
ACM Transactions on Mathematical Software
Published
1977-09
Volume
3
Issue
3
Pages
209-226
ISSN
  • 0098-3500 (ISSN-L)
  • 1557-7295
OpenAlex
W2024668293
Cited by
2,813
References
10
FWCI
9.38
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

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.