Los puntos clave no están disponibles para este artículo en este momento.
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.
Friedman et al. (Wed,) studied this question.