Exact and/or Fast Nearest Neighbors

by   Matthew Francis-Landau, et al.

Prior methods for retrieval of nearest neighbors in high dimensions are fast and approximate–providing probabilistic guarantees of returning the correct answer–or slow and exact performing an exhaustive search. We present Certified Cosine, a novel approach to nearest-neighbors which takes advantage of structure present in the cosine similarity distance metric to offer certificates. When a certificate is constructed, it guarantees that the nearest neighbor set is correct, possibly avoiding an exhaustive search. Certified Cosine's certificates work with high dimensional data and outperform previous exact nearest neighbor methods on these datasets.


page 1

page 2

page 3

page 4


Fast top-K Cosine Similarity Search through XOR-Friendly Binary Quantization on GPUs

We explore the use of GPU for accelerating large scale nearest neighbor ...

Manifold learning with approximate nearest neighbors

Manifold learning algorithms are valuable tools for the analysis of high...

Comparing apples to apples in the evaluation of binary coding methods

We discuss methodological issues related to the evaluation of unsupervis...

Fast k-means based on KNN Graph

In the era of big data, k-means clustering has been widely adopted as a ...

Parallel Nearest Neighbors in Low Dimensions with Batch Updates

We present a set of parallel algorithms for computing exact k-nearest ne...

A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search

One of the approaches for the nearest neighbor search problem is to buil...

Learning Query Expansion over the Nearest Neighbor Graph

Query Expansion (QE) is a well established method for improving retrieva...