K-Nearest Neighbor Approximation Via the Friend-of-a-Friend Principle

08/20/2019
by   Jacob D. Baron, et al.
0

Suppose V is an n-element set where for each x ∈ V, the elements of V ∖{x} are ranked by their similarity to x. The K-nearest neighbor graph to the K points of V ∖{x} most similar to x. Constructive approximation to this graph using far fewer than n^2 comparisons is important for the analysis of large high-dimensional data sets. K-Nearest Neighbor Descent is a parameter-free heuristic where a sequence of graph approximations is constructed, in which second neighbors in one approximation are proposed as neighbors in the next. We provide a rigorous justification for O( n n ) complexity of a similar algorithm, using range queries, when applied to a homogeneous Poisson process in suitable dimension, but show that the basic algorithm fails to achieve subquadratic complexity on sets whose similarity rankings arise from a "generic" linear order on the n2 inter-point distances in a metric space.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2007

A Note on Approximate Nearest Neighbor Methods

A number of authors have described randomized algorithms for solving the...
research
02/26/2018

All nearest neighbor calculation based on Delaunay graphs

When we have two data sets and want to find the nearest neighbour of eac...
research
12/05/2022

Stars: Tera-Scale Graph Building for Clustering and Graph Learning

A fundamental procedure in the analysis of massive datasets is the const...
research
02/14/2019

Finding Nearest Neighbors in graphs locally

Many distributed learning techniques have been motivated by the increasi...
research
10/18/2022

Unsupervised visualization of image datasets using contrastive learning

Visualization methods based on the nearest neighbor graph, such as t-SNE...
research
02/04/2023

Rank-based linkage I: triplet comparisons and oriented simplicial complexes

Rank-based linkage is a new tool for summarizing a collection S of objec...
research
02/05/2019

Analyzing and Improving Representations with the Soft Nearest Neighbor Loss

We explore and expand the Soft Nearest Neighbor Loss to measure the enta...

Please sign up or login with your details

Forgot password? Click here to reset