Approximate vs. Representative Nearest Neighbors

Thomas Breuel
Snowbird Learning Workshop, Snowbird, Conference Proceedings, Snowbird, UT, 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, ...

Files:

  BreuelApprox_vs_ReprNeighbors.pdf

BibTex:

@inproceedings{ BREU2005,
	Title = {Approximate vs. Representative Nearest Neighbors},
	Author = {Thomas Breuel},
	BookTitle = {Snowbird Learning Workshop},
	Year = {2005},
	Publisher = {Conference Proceedings},
	Address = {Snowbird, UT}
}

     
Last modified:: 30.08.2016