Publication
Approximate vs. Representative Nearest Neighbors
Thomas Breuel
In: Snowbird Learning Workshop. Snowbird Workshop on Learning, Snowbird, Conference Proceedings, 2005.
Abstract
Over the last several years, there has been renewed interest in efficient nearest neighbor search algorithms. Such algorithms have uses in areas like information retrieval, pattern recognition, data mining, compression, and databases. Known algorithms for the exact nearest neighbor problem have such complexities that, in practice, high dimensional nearest neighbor problems are usually solved with brute force search, that is, computing the distance of the query point with each data point in the database. In order to achieve better performance than brute force search, ...