A Note on Approximate Nearest Neighbor Methods

Simple item page
dc.creatorBreuel, Thomas M.
dc.date2007-03-21
dc.date.accessioned2026-07-07T07:53:11Z
dc.date.available2026-07-07T07:53:11Z
dc.descriptionA number of authors have described randomized algorithms for solving the epsilon-approximate nearest neighbor problem. In this note I point out that the epsilon-approximate nearest neighbor property often fails to be a useful approximation property, since epsilon-approximate solutions fail to satisfy the necessary preconditions for using nearest neighbors for classification and related tasks.
dc.descriptionThe report was originally written in 2005 and does not reference information after that date
dc.identifierhttps://arxiv.org/abs/cs/0703101
dc.identifierhttp://arxiv.org/abs/cs/0703101
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126161
dc.subjectInformation Retrieval
dc.subjectComputational Complexity
dc.subjectComputer Vision and Pattern Recognition
dc.titleA Note on Approximate Nearest Neighbor Methods
dc.typetext

Files

Collections

arXiv