An Algorithm for Finding Nearest Neighbors
Jerome H. Friedman, Forest Baskett, Leonard J. Shustek · IEEE Transactions on Computers · 1975
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.
Cited by 394 works. doi:10.1109/t-c.1975.224110 Open-access PDF
Authors
References
- Nearest neighbor pattern classification
- A Nonparametric Estimate of a Multivariate Density Function
- The condensed nearest neighbor rule (Corresp.)
- Optimization of k nearest neighbor density estimates
- A generalized k-nearest neighbor rule
- Convergence of the nearest neighbor rule
- An Easily Mechanized Scheme for an Adaptive Pattern Recognizer