This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
July 1975 (vol. 24 no. 7)
pp. 750-753
K. Fukunage, School of Electrical Engineering, Purdue University
Computation of the k-nearest neighbors generally requires a large number of expensive distance computations. The method of branch and bound is implemented in the present algorithm to facilitate rapid calculation of the k-nearest neighbors, by eliminating the necesssity of calculating many distances. Experimental results demonstrate the efficiency of the algorithm. Typically, an average of only 61 distance computations were made to find the nearest neighbor of a test sample among 1000 design samples.
Index Terms:
Branch and bound, distance computation, hierarchical decomposition, k-nearest neighbors, tree-search algorithm.
Citation:
K. Fukunage, P.M. Narendra, "A Branch and Bound Algorithm for Computing k-Nearest Neighbors," IEEE Transactions on Computers, vol. 24, no. 7, pp. 750-753, July 1975, doi:10.1109/T-C.1975.224297
Usage of this product signifies your acceptance of the Terms of Use.