A new compressed cover tree guarantees a near linear parameterized complexity for all k-nearest neighbors search in metric spaces

by   Yury Elkin, et al.

This paper studies the classical problem of finding all k nearest neighbors to points of a query set Q in another reference set R within any metric space. The well-known work by Beygelzimer, Kakade, and Langford in 2006 introduced cover trees and claimed to guarantee a near linear time complexity in the size |R| of the reference set for k=1. Our previous work defined compressed cover trees and corrected the key arguments for k≥ 1 and previously unknown challenging data cases. In 2009 Ram, Lee, March, and Gray attempted to improve the time complexity by using pairs of cover trees on the query and reference sets. In 2015 Curtin with the above co-authors used extra parameters to finally prove a similar complexity for k = 1. Our work fills all previous gaps and substantially improves the neighbor search based on pairs of new compressed cover trees. The novel imbalance parameter of paired trees allowed us to prove a better time complexity for any number of neighbors k≥ 1.


page 1

page 2

page 3

page 4


Paired compressed cover trees guarantee a near linear parametrized complexity for all k-nearest neighbors search in an arbitrary metric space

This paper studies the important problem of finding all k-nearest neighb...

Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006

This paper is motivated by the k-nearest neighbors search: given an arbi...

A new compressed cover tree for k-nearest neighbour search and the stable-under-noise mergegram of a point cloud

This thesis consists of two topics related to computational geometry and...

Low Complexity Sequential Search with Measurement Dependent Noise

This paper considers a target localization problem where at any given ti...

Two Metrics on Rooted Unordered Trees with Labels

On the space of rooted trees with possibly repeated labels, where all ve...

Efficient Learning of Distributed Linear-Quadratic Controllers

In this work, we propose a robust approach to design distributed control...

Deterministic Iteratively Built KD-Tree with KNN Search for Exact Applications

K-Nearest Neighbors (KNN) search is a fundamental algorithm in artificia...

Please sign up or login with your details

Forgot password? Click here to reset