An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)

Volumn 3, Issue 3, 1977, Pages 209-226

  Friedman, Jerome H ^a   Bentley, Jon Louis ^b   Finkel, Raphael Ari ^c  

^a SLAC NATIONAL ACCELERATOR LABORATORY   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84945709355     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/355744.355745     Document Type: Article

References (11)

1. 1 BENTLEY, J.L. Multidimensional binary search trees used for associative searching. Comm. ACM 18, 9 (Sept. 1975), 509-517.]
2. 2 BURKHARV, W.A., and KELLER, R M. Some approaches to best match file searching. Comm. ACM 16, 4 (April 1973), 230-236.]
3. 3 FINKEL, R.A., AND BENTLEY, J.L. Quad trees–a data structure for retrmval on composite keys. Acta Informatica 4, 1 (1974), 1-9.]
4. 4 FRIEDMAN, J.H., BASKETT, F., AND SHUSTEK, L.J. An algorithm for finding nearest neighbors. IEEE Trans. Comptrs C-24 (1975), 1000-1006.]
5. 5 FUKUNAGA, K., and HOSTETLER, L.D Optimization of k-nearest neighbor density estimates. 1EEE Trans. Inform Theory IT-19 (1973), 320-326.]
6. 6 FUKUNAGA, K., and NARENDRA, P.M. A branch and bound algorithm for computing k-nearest neighbors. IEEE Trans. Comptrs. C-24 (1975), 750-753.]
7. 7 HYAYIL, L., Am) RZVEST, R.L. Constructing optimal binary decision trees is NP-complete. Information Processing Letters 5, (May 1976), 15-17.]
8. 8 KNUTH, D.E. The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, Mass., 1969, p. 401.]
9. 9 PIZER, S.M. Numerical Computing and Mathematical Analysis, Science Research Associates, Chicago, Ill., 1975, p. 88, eq. 87.]
10. 10 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.]
11. 11 SHAMOS, M.I. Geometric Complexity. Conf. Rec. Seventh Annual ACM Syrup. on Theory of Comptng, Albuquerque, N.Mex., May 1975, 224-233.]