Analysis of k-nearest neighbor branch and bound rules

Authors:
Soren Larsen;Laveen N Kanal
Affiliations:
Institute for Physical Science and Technology, University of Maryland, College Park, MD 20742, USA;Machine Intelligence and Pattern Analysis Lab., Dept. of Computer Science, University of Maryland, College Park, MD 20742, USA
Venue:
Pattern Recognition Letters
Year:
1986

Citing 2
Cited 0

A Branch and Bound Algorithm for Computing k-Nearest Neighbors

IEEE Transactions on Computers
An improved branch and bound algorithm for computing k-nearest neighbors

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

This paper analyzes the applicability and relative efficiency of four pruning rules for finding k-nearest neighbors by a branch and bound algorithm. Results of experimental simulations with various clustering schemes and data distributions are included.