Algorithm for finding nearest neighbors

Journal Article · Wed Oct 01 04:00:00 EDT 1975 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/T-C.1975.224110· OSTI ID:7299511

Friedman, J H ^[1]; Baskett, F; Shustek, L J

---

1. Stanford Linear Accelerator Center, CA.

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 E(n/sub d/) < or approximately equal to ..pi../sup /sup -1///sub 2//(kdGAMMA(d/2))/sup 1/d/(2N)/sup 1 -//sup (1/d)/ is described, its properties are examined, and the validity of the estimate is verified with simulated data. (6 figures) (auth)

• OSTI ID: 7299511
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States); ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics &amp; Computers
ACCURACY
ALGORITHMS
CONFIGURATION
CRYSTAL STRUCTURE
DISTANCE
MATHEMATICAL LOGIC