A Randomized Approximate Nearest Neighbors Algorithm
YALE UNIV NEW HAVEN CT DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
In this paper, we describe an algorithm for finding approximate nearest neighbors ANN in d-dimensional Euclidean space for each of N user-specified points xj. For each point xj , the scheme produces a list of k suspects , that have high probability of being the k closest points nearest neighbors in the Euclidean metric. Those of the suspects that are not among the true nearest neighbors, are close to being so.
- Numerical Mathematics