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

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

An optimal algorithm for approximate nearest neighbor searching fixed dimensions

Open access
Arya, Sunil, Mount, David M., Netanyahu, Nathan S., Silverman, Ruth, Wu, Angela Y. · 1998 · Journal of the ACM

Abstract

Consider a set of S of n data points in real d -dimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching, we preprocess S into a data structure, so that given any query point q ∈ R d , is the closest point of S to q can be reported quickly. Given any positive real ϵ, data point p is a (1 +ϵ)- approximate nearest neighbor of q if its distance from q is within a factor of (1 + ϵ) of the distance to the true nearest neighbor. We show that it is possible to preprocess a set of n points in R d in O(dn log n ) time and O(dn) space, so that given a query point q ∈ R d , and ϵ > 0, a (1 + ϵ)-approximate nearest neighbor of q can be computed in O ( c d , ϵ log n ) time, where c d,ϵ ≤ d ⌈1 + 6d/ϵ⌉ d is a factor depending only on dimension and ϵ. In general, we show that given an integer k ≥ 1, (1 + ϵ)-approximations to the k nearest neighbors of q can be computed in additional O(kd log n ) time.

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/293347.293348

Cites

55 of 55 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: 15

  1. 10.1109/DCC.1993.253111 · doi:10.1109/dcc.1993.253111
  2. 10.1145/220279.220296 · doi:10.1145/220279.220296
  3. 10.1145/129712.129766 · doi:10.1145/129712.129766
  4. CALLAHAN , P. B. , AND KOSARAJU , S.U. 1995 . Algorithms for dynamic closest pair and n-body potential fields . In Proceedings of the 6th Annual A CM-SIAM Symposium on Discrete Algorithms ( San Francisco, Calif., Jan. 22-24). ACM, New York , pp. 263 - 272 . CALLAHAN, P. B., AND KOSARAJU, S.U. 1995. Algorithms for dynamic closest pair and n-body potential fields. In Proceedings of the 6th Annual A CM-SIAM Symposium on Discrete Algorithms (San Francisco, Calif., Jan. 22-24). ACM, New York, pp. 263-272.
  5. 10.1109/SFCS.1983.16 · doi:10.1109/sfcs.1983.16
  6. 10.1145/355826.355832 · doi:10.1145/355826.355832
  7. 10.1023/A:1022664626993 · doi:10.1023/a:1022664626993 · Paper page
  8. 10.1109/TIT.1985.1057040 · doi:10.1109/tit.1985.1057040
  9. FAYYAD , U. M. , PIATETSKY-SHAPIRO , G. , SMYTH , P. , AND UTHURUSAMY , R. 1996. Advances in Knowledge Discovery and Data Mining . AAAI Press/MIT Press , Cambridge, Mass . FAYYAD, U. M., PIATETSKY-SHAPIRO, G., SMYTH, P., AND UTHURUSAMY, R. 1996. Advances in Knowledge Discovery and Data Mining. AAAI Press/MIT Press, Cambridge, Mass.
  10. 10.1137/0214055 · doi:10.1137/0214055
  11. FREDERICKSON , G.N. 1993 . A data structure for dynamically maintaining rooted trees . In Proceedings of the 4th Annual A CM-SIAM Symposium on Discrete Algorithms. ACM , New York , pp. 175 - 194 . FREDERICKSON, G.N. 1993. A data structure for dynamically maintaining rooted trees. In Proceedings of the 4th Annual A CM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 175-194.
  12. GALPERIN , I. , AND RIVEST , R. L. 1993 . Scapegoat trees . In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms. ACM , New York , pp. 165 - 174 . GALPERIN, I., AND RIVEST, R. L. 1993. Scapegoat trees. In Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 165-174.
  13. MOUNT , D. M. , NETANYAHU , N. , SILVERMAN , R. , AND WU , A. Y. 1995 . Chromatic nearest neighbor searching: A query sensitive approach . In Proceedings of the 7th Canadian Conference on Computer Geometry. (Quebec City, Que., Canada, Aug. 10-13) . pp. 261 - 266 . MOUNT, D. M., NETANYAHU, N., SILVERMAN, R., AND WU, A. Y. 1995. Chromatic nearest neighbor searching: A query sensitive approach. In Proceedings of the 7th Canadian Conference on Computer Geometry. (Quebec City, Que., Canada, Aug. 10-13). pp. 261-266.
  14. 10.1007/BF01377181 · doi:10.1007/bf01377181
  15. 10.5555/645481.655573 · doi:10.5555/645481.655573

Cited by

See all 2,300

Metadata

Authors
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y.
Venue
Journal of the ACM
Published
1998-11
Volume
45
Issue
6
Pages
891-923
ISSN
  • 0004-5411 (ISSN-L)
  • 1557-735X
OpenAlex
W2427881153
Cited by
2,300
References
55
FWCI
37.55
Type
journal article
Language
en
Open access
bronze

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.