An improved branch and bound algorithm for computing k-nearest neighbors

Authors:
Behrooz Kamgar-Parsi;Laveen N Kanal
Affiliations:
Laboratory of Applied Studies, Division of Computer Research and Technology, National Institutes of Health, Bethesda, MD 20205, USA;Machine Intelligence and Pattern Analysis Lab, Department of Computer Science, University of Maryland, College Park, MD 20742, USA
Venue:
Pattern Recognition Letters
Year:
1985

Citing 1
Cited 5

A Branch and Bound Algorithm for Computing k-Nearest Neighbors

IEEE Transactions on Computers

Some approaches to improve tree-based nearest neighbour search algorithms

Pattern Recognition
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set

Information Processing Letters
Paper: Nearest neighbor classification on two types of SIMD machines

Parallel Computing
A Greedy Randomized Adaptive Search Procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

Mathematical and Computer Modelling: An International Journal
Analysis of k-nearest neighbor branch and bound rules

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

In 1975 Fukunaga and Narendra proposed an efficient branch and bound algorithm for computing k-nearest neighbors. Their algorithm, after a hierarchical decomposition of the design set into disjoint subsets, employs two rules in order to eliminate the necessity of calculating many distances. This correspondence discusses the applicability of two additional rules for a further reduction of the number of distance computations. Experimental results using samples from bivariate Gaussian and uniform distributions suggest that the number of distance computations required by the modified is typicaly one fourth of that of the Fukunaga-Narendra algorithm.