Title :
An Algorithm for Finding Nearest Neighbors
Author :
Friedman, Jerome H. ; Baskett, Forest ; Shustek, Leonard J.
Author_Institution :
Stanford Linear Accelerator Center
Abstract :
An algorithm that finds the k nearest neighbors of a point, from a sample of size N in a d-dimensional space, with an expected number of distance calculations is described, its properties examined, and the validity of the estimate verified with simulated data.
Keywords :
Index Terms-Best match, nearest neighbors, nonparametric discrimination, searching, sorting.; Computational modeling; Computer science; Linear accelerators; Nearest neighbor searches; Pattern classification; Predictive models; Prototypes; Sorting; Testing; Virtual prototyping; Index Terms-Best match, nearest neighbors, nonparametric discrimination, searching, sorting.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1975.224110
