A Note on Approximate Nearest Neighbor Methods

03/21/2007
by   Thomas M. Breuel, et al.
0

A number of authors have described randomized algorithms for solving the epsilon-approximate nearest neighbor problem. In this note I point out that the epsilon-approximate nearest neighbor property often fails to be a useful approximation property, since epsilon-approximate solutions fail to satisfy the necessary preconditions for using nearest neighbors for classification and related tasks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2020

A Nearest Neighbor Characterization of Lebesgue Points in Metric Measure Spaces

The property of almost every point being a Lebesgue point has proven to ...
research
05/12/2021

From Average Embeddings To Nearest Neighbor Search

In this note, we show that one can use average embeddings, introduced re...
research
07/22/2013

Solving Traveling Salesman Problem by Marker Method

In this paper we use marker method and propose a new mutation operator t...
research
09/26/2018

An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time

This paper proposes a new algorithm for reducing Approximate Nearest Nei...
research
08/20/2019

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

Suppose V is an n-element set where for each x ∈ V, the elements of V ∖{...
research
07/03/2023

Online nearest neighbor classification

We study an instance of online non-parametric classification in the real...
research
08/24/2010

A Simple CW-SSIM Kernel-based Nearest Neighbor Method for Handwritten Digit Classification

We propose a simple kernel based nearest neighbor approach for handwritt...

Please sign up or login with your details

Forgot password? Click here to reset