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

01/17/2022
by   Yury Elkin, et al.
0

This paper studies the important problem of finding all k-nearest neighbors to points of a query set Q in another reference set R within any metric space. Our previous work defined compressed cover trees and corrected the key arguments in several past papers for challenging datasets. 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 time complexity for k=1. The current work fills all previous gaps and improves the nearest 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2021

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

This paper studies the classical problem of finding all k nearest neighb...
research
08/19/2022

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...
research
05/20/2022

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...
research
02/25/2019

Adaptive Estimation for Approximate k-Nearest-Neighbor Computations

Algorithms often carry out equally many computations for "easy" and "har...
research
12/05/2021

Learning Query Expansion over the Nearest Neighbor Graph

Query Expansion (QE) is a well established method for improving retrieva...
research
03/22/2021

Two Metrics on Rooted Unordered Trees with Labels

On the space of rooted trees with possibly repeated labels, where all ve...
research
06/14/2019

Eclipse: Generalizing kNN and Skyline

k nearest neighbor (kNN) queries and skyline queries are important opera...

Please sign up or login with your details

Forgot password? Click here to reset