The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
An Algorithm for Finding Best Matches in Logarithmic Expected Time
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.
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
Constructing optimal binary decision trees is NP-complete
Hyafil, L., & Rivest, R. L. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90095-8 · Cited by 959
Research works printed but not linked: 10
- 10.1145/361002.361007 · DOI · Paper page
- 10.1145/362003.362025 · DOI · Paper page
- FINKEL , R.A. , AND BENTLEY , J.L . Quad trees--a data structure for retrmval on composite keys . Acta Informatica 4 , 1 ( 1974 ), 1-9. FINKEL, R.A., AND BENTLEY, J.L. Quad trees--a data structure for retrmval on composite keys. Acta Informatica 4, 1 (1974), 1-9. · DOI
- FRIEDMAN , J.H. , BASKETT , F. , AND SHUSTEK , L.J . An algorithm for finding nearest neighbors . IEEE Trans. Comptrs C-24 ( 1975 ), 1000 - 1006 . FRIEDMAN, J.H., BASKETT, F., AND SHUSTEK, L.J. An algorithm for finding nearest neighbors. IEEE Trans. Comptrs C-24 (1975), 1000-1006. · DOI · Paper page
- FUKUNAGA , K. , AND HOSTETLER , L.D Optimization of k-nearest neighbor density estimates. 1EEE Trans . Inform Theory IT-19 ( 1973 ), 320 - 326 . FUKUNAGA, K., AND HOSTETLER, L.D Optimization of k-nearest neighbor density estimates. 1EEE Trans. Inform Theory IT-19 (1973), 320-326. · DOI · Paper page
- FUKUNAGA , K. , AND NARENDRA , P.M . A branch and bound algorithm for computing k-nearest neighbors . IEEE Trans. Comptrs. C-24 ( 1975 ), 750 - 753 . FUKUNAGA, K., AND NARENDRA, P.M. A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comptrs. C-24 (1975), 750-753. · DOI · Paper page
- KNUTH , D.E. The Art of Computer Programming , Vol. 1 , Addison-Wesley , Reading, Mass ., 1969 , p. 401. KNUTH, D.E. The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, Mass., 1969, p. 401.
- 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.
- RIVEST , R. On the optimality of Elias' algorithm for performing best match searches. Information Processing 74 , North-Holland Pub. Co. , Amsterdam , 1974 , pp. 678 - 681 . RIVEST, R. On the optimality of Elias' algorithm for performing best match searches. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 678-681.
- 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
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Top 10 algorithms in data mining
Wu, X., Kumar, V., Ross Quinlan, J., Ghosh, J., Yang, Q., Motoda, H., McLachlan, G. J., Ng, A., Liu, B., Yu, P. S., et al. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0114-2 · Cited by 5,667
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
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
- 1
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Algorithm for Finding Best Matches in Logarithmic Expected Time. https://app.cochat.ai/papers/10.1145/355744.355745
- The paper
- Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977). An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Transactions on Mathematical Software. https://doi.org/10.1145/355744.355745
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.
