no code implementations • 30 Jan 2022 • Jacob D. Baron, R. W. R. Darling
A Java parallel streams implementation of the $K$-nearest neighbor descent algorithm is presented using a natural statistical termination criterion.
no code implementations • 20 Aug 2019 • Jacob D. Baron, R. W. R. Darling
The $K$-nearest neighbor graph is a directed graph including an arc from each $x$ to the $K$ points of $V \setminus \{x\}$ most similar to $x$.
Combinatorics Statistics Theory Statistics Theory 90C35, 06A07
