A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree.

Yury Elkin, Vitaliy Kurlin

Browse the full ICML paper archive.