## Nearest Neighbor Search in Multidimensional Spaces (1999)

Citations: | 9 - 0 self |

### BibTeX

@TECHREPORT{Tsaparas99nearestneighbor,

author = {Panayiotis Tsaparas},

title = {Nearest Neighbor Search in Multidimensional Spaces},

institution = {},

year = {1999}

}

### OpenURL

### Abstract

The Nearest Neighbor Search problem is defined as follows: given a set P of n points, preprocess the points so as to efficiently answer queries that require finding the closest point in P to a query point q. If we are willing to settle for a point that is almost as close as the nearest neighbor, then we can relax the problem to the approximate Nearest Neighbor Search. Nearest Neighbor Search (exact or approximate) is an integral component in a wide range of applications that include multimedia databases, computational biology, data mining, and information retrieval. The common thread in all these applications is similarity search: given a database of objects, we want to return the object in the database that is most similar to a query object. The objects are mapped onto points in a high dimensional metric space , and similarity search reduces to a nearest neighbor search. The dimension of the underlying space may be in the order of a few hundreds, or thousands; therefore, we r...