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