= (1+ε)-approximate nearest neighbor search
{wiki=(1+ε)-approximate_nearest_neighbor_search}
(1 + ε)-approximate nearest neighbor search is a concept in computational geometry and computer science that pertains to efficiently finding points in a dataset that are close to a given query point, within a certain tolerance of distance. In more formal terms, given a set of points in a metric space (or Euclidean space), the goal of the nearest neighbor search is to find the point in the set that is closest to a query point.
Back to article page