New LSH-based Algorithm for Approximate Nearest Neighbor

Author(s)
Andoni, Alexandr; Indyk, Piotr
Thumbnail
DownloadMIT-CSAIL-TR-2005-073.ps (11383Kb)
Additional downloads
Metadata
Show full item record
Abstract
We present an algorithm for c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time ofO(dn^{1/c^2+o(1)}) and space O(dn + n^{1+1/c^2+o(1)}).
Date issued
2005-11-04
URI
http://hdl.handle.net/1721.1/30583
Other identifiers
MIT-CSAIL-TR-2005-073
AIM-2005-031
Series/Report no.
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
Keywords
AI, locality sensitive hashing, nearest neighbor, high dimensions
Collections