%CE%95-approximate Nearest Neighbor Search
Get %CE%95-approximate Nearest Neighbor Search essential facts below. View Videos or join the %CE%95-approximate Nearest Neighbor Search discussion. Add %CE%95-approximate Nearest Neighbor Search to your PopFlock.com topic list for future reference or share this resource on social media.
%CE%95-approximate Nearest Neighbor Search

(1+?)-approximate nearest neighbor search is a special case of the nearest neighbor search problem. The solution to the (1+?)-approximate nearest neighbor search is a point or multiple points within distance (1+?) R from a query point, where R is the distance between the query point and its true nearest neighbor.[1]

Reasons to approximate nearest neighbor search include the space and time costs of exact solutions in high-dimensional spaces (see curse of dimensionality) and that in some domains, finding an approximate nearest neighbor is an acceptable solution.

Approaches for solving (1+?)-approximate nearest neighbor search include kd-trees,[2]Locality Sensitive Hashing and brute force search.


References

  1. ^ Arya, Sunil; Mount, David M. (1993). "Approximate Nearest Neighbor Queries in Fixed Dimensions" (PDF). SODA. 93.
  2. ^ Arya, Sunil; Mount, David M.; Netanyahu, Nathan; Silverman, Ruth; Wu, Angela Y. (1994). "An optimal algorithm for approximate nearest neighbor searching in fixed dimensions" (PDF). Proc. 5th ACM-SIAM Sympos. Discrete Algorithms.

  This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

%CE%95-approximate_nearest_neighbor_search
 



 



 
Music Scenes