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
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.
Integrity signals
Registry
Cites
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.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
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
Self-citationThe Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Quad trees a data structure for retrieval on composite keys
Finkel, R. A., & Bentley, J. L. (1974) · Acta Informatica · doi:10.1007/bf00288933 · Cited by 2,041
Self-citationConstructing 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
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
Fukunaga, K., & Narendra, P. M. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224297 · Cited by 736
Some approaches to best-match file searching
Burkhard, W. A., & Keller, R. M. (1973) · Communications of the ACM · doi:10.1145/362003.362025 · Cited by 413
An Algorithm for Finding Nearest Neighbors
Friedman, J. H., Baskett, F., & Shustek, L. J. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224110 · Cited by 394
Self-citationOptimization of k nearest neighbor density estimates
Fukunaga, K., & Hostetler, L. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055003 · Cited by 188
On the Optimality of Elia's Algorithm for Performing Best-Match Searches.
Rivest, R. L. (1974) · IFIP Congress · Cited by 32
Research works printed but not linked: 2
- 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.
- 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
Items 101–123 of 123
Scranton, R., Johnston, D., Dodelson, S., Frieman, J. A., Connolly, A., Eisenstein, D. J., Gunn, J. E., Hui, L., Jain, B., Kent, S., et al. (2002) · The Astrophysical Journal · doi:10.1086/342786 · Cited by 271
Similarity Metric Learning for a Variable-Kernel Classifier
Lowe, D. G. (1995) · Neural Computation · doi:10.1162/neco.1995.7.1.72 · Cited by 267
Get Out of My Lab: Large-scale, Real-Time Visual-Inertial Localization
Lynen, S., Sattler, T., Bosse, M., Hesch, J., Pollefeys, M., & Siegwart, R. (2015) · Robotics: Science and Systems XI · doi:10.15607/rss.2015.xi.037 · Cited by 243
Moore, A. W., & Atkeson, C. G. (1995) · Machine Learning · doi:10.1023/a:1022656217772 · Cited by 259
Registration and integration of textured 3-D data
Johnson, A. E., & Kang, S. B. (2002) · Proceedings. International Conference on Recent Advances in 3-D Digital Imaging and Modeling (Cat. No.97TB100134) · doi:10.1109/im.1997.603871 · Cited by 259
Dimensionality reduction for similarity searching in dynamic databases
Ravi Kanth, K. V., Agrawal, D., & Singh, A. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276320 · Cited by 256
Fast Similarity Search for Learned Metrics
Kulis, B., Jain, P., & Grauman, K. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.151 · Cited by 256
Stefánsson, A., Končar, N., & Jones, A. J. (1997) · Neural Computing & Applications · doi:10.1007/bf01413858 · Cited by 254
Galindo, J., & Tamayo, P. (2000) · Computational Economics · doi:10.1023/a:1008699112516 · Cited by 254
A Survey on Deep Hashing Methods
Luo, X., Wang, H., Wu, D., Chen, C., Deng, M., Huang, J., & Hua, X.-S. (2023) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3532624 · Cited by 241
Large-Scale Cross-Modality Search via Collective Matrix Factorization Hashing
Ding, G., Guo, Y., Zhou, J., & Gao, Y. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2607421 · Cited by 218
Pose estimation for spacecraft relative navigation using model-based algorithms
Opromolla, R., Fasano, G., Rufino, G., & Grassi, M. (2017) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2017.2650785 · Cited by 127
Grauman, K., & Leibe, B. (2011) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.2200/s00332ed1v01y201103aim011 · Cited by 126
Learning to Hash With Optimized Anchor Embedding for Scalable Retrieval
Guo, Y., Ding, G., Liu, L., Han, J., & Shao, L. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2652730 · Cited by 108
A computational study of mental health awareness campaigns on social media
Saha, K., Torous, J., Ernala, S. K., Rizuto, C., Stafford, A., & De Choudhury, M. (2019) · Translational Behavioral Medicine · doi:10.1093/tbm/ibz028 · Cited by 93
Selecting Representative Data Sets
Borovicka, T., Jirina, M., Kordik, P., & Jiri, M. (2012) · Advances in Data Mining Knowledge Discovery and Applications · doi:10.5772/50787 · Cited by 94
Zhang, X., Yang, C., Nepal, S., Liu, C., Dou, W., & Chen, J. (2013) · 2013 International Conference on Cloud and Green Computing · doi:10.1109/cgc.2013.24 · Cited by 43
Automatic 3d free form shape matching using the graduated assignment algorithm
Liu, Y. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2005.01.008 · Cited by 37
Automating image segmentation verification and validation by learning test oracles
Frounchi, K., Briand, L. C., Grady, L., Labiche, Y., & Subramanyan, R. (2011) · Information and Software Technology · doi:10.1016/j.infsof.2011.06.009 · Cited by 31
A mean field annealing approach to accurate free form shape matching
Liu, Y. (2007) · Pattern Recognition · doi:10.1016/j.patcog.2006.11.025 · Cited by 28
Constraints for closest point finding
Liu, Y. (2008) · Pattern Recognition Letters · doi:10.1016/j.patrec.2007.12.004 · Cited by 15
3D model reconstruction using neural gas accelerated on GPU
Orts-Escolano, S., Garcia-Rodriguez, J., Serra-Perez, J. A., Jimeno-Morenilla, A., Garcia-Garcia, A., Morell, V., & Cazorla, M. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.03.042 · Cited by 8
Steger, C. (2017) · Handbook of Machine and Computer Vision · doi:10.1002/9783527413409.ch9 · Cited by 6
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.