Nearest neighbor search
(AS A FORM OF PROXIMITY SEARCH (METRIC SPACE)) OPTIMIZATION PROBLEM OF FINDING THE POINT IN A GIVEN SET THAT IS CLOSEST (OR MOST SIMILAR) TO A GIVEN POINT
Nearest neighbor problem; Proximity search (metric space); Nearest neighbour search; Closest point search; Nearest neighbour problem; Closest point query; Nearest neighbor query; Nearest neighbour query; Post-office problem; Post office problem; Nearest neighbor method; Post-office search algorithm; Approximate nearest-neighbor search algorithm; Approximation algorithms for nearest-neighbor search; Nearest neighbor distance ratio; Approximate nearest neighbor search algorithms; Applications of nearest neighbor search
Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most similar) to a given point. Closeness is typically expressed in terms of a dissimilarity function: the less similar the objects, the larger the function values.