An Algorithm for Finding Best Matches in Logarithmic Expected Time

Journal Article · Thu Jul 01 04:00:00 EDT 1976 · ACM Transactions on Mathematical Software

DOI:https://doi.org/10.1145/355744.355745· OSTI ID:1443274

Friedman, Jerome H. ^[1]; Bentley, Jon Louis ^[2]; Finkel, Raphael Ari ^[3]

Stanford Linear Accelerator Center, Stanford University, Stanford, CA
Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC
Department of Computer Science, Stanford University, Stanford, CA

Research Organization:: SLAC National Accelerator Laboratory (SLAC), Menlo Park, CA (United States)

Journal Information:: ACM Transactions on Mathematical Software, Journal Name: ACM Transactions on Mathematical Software Journal Issue: 3 Vol. 3; ISSN 0098-3500

References (7)

Some approaches to best-match file searching Burkhard, W. A.; Keller, R. M. Communications of the ACM, Vol. 16, Issue 4 https://doi.org/10.1145/362003.362025	journal	April 1973
Constructing optimal binary decision trees is NP-complete Hyafil, Laurent; Rivest, Ronald L. Information Processing Letters, Vol. 5, Issue 1 https://doi.org/10.1016/0020-0190(76)90095-8	journal	May 1976
Quad trees a data structure for retrieval on composite keys Finkel, R. A.; Bentley, J. L. Acta Informatica, Vol. 4, Issue 1 https://doi.org/10.1007/BF00288933	journal	January 1974
Multidimensional binary search trees used for associative searching Bentley, Jon Louis Communications of the ACM, Vol. 18, Issue 9 https://doi.org/10.1145/361002.361007	journal	September 1975
A Branch and Bound Algorithm for Computing k-Nearest Neighbors Fukunaga, K.; Narendra, P. M. IEEE Transactions on Computers, Vol. C-24, Issue 7 https://doi.org/10.1109/T-C.1975.224297	journal	July 1975
An Algorithm for Finding Nearest Neighbors Friedman, J. H.; Baskett, F.; Shustek, L. J. IEEE Transactions on Computers, Vol. C-24, Issue 10 https://doi.org/10.1109/T-C.1975.224110	journal	October 1975
Optimization of k nearest neighbor density estimates Fukunaga, K.; Hostetler, L. IEEE Transactions on Information Theory, Vol. 19, Issue 3 https://doi.org/10.1109/TIT.1973.1055003	journal	May 1973

Optical Cluster-Finding with an Adaptive Matched-Filter Technique: Algorithm and Comparison with Simulations

Journal Article · Mon Oct 29 00:00:00 EDT 2007 · Submitted to Astrophysical Journal · OSTI ID:918970

Examine realistic financing alternatives to find the best match for your project

Journal Article · Tue Aug 01 00:00:00 EDT 1995 · Hart`s Oil and Gas World · OSTI ID:161676

An Algorithm for Finding Nearest Neighbors

Journal Article · Wed Oct 01 00:00:00 EDT 1975 · IEEE Transactions on Computers · OSTI ID:1443139