LiK+MalikJ-2017

Notes about [LiK+MalikJ-2017] 1 .

This paper describes an effecient algorithm for searching for k-nearest neighbours. It states that the algorithm is reduces the number of distance evaluations by a factor of 14 to 116 and the memory consumption by a factor of 21 compared to prior methods.

1

K Li and J Malik. Fast k-nearest neighbour search via dynamic continuous indexing. 2017. URL: https://arxiv.org/abs/1512.00442, PDF: LiK+MalikJ-2017.pdf, Notes: LiK+MalikJ-2017.html (this file).