Practical and optimal LSH for angular distance

Practical and optimal LSH for angular distance

We show the existence of a Locality-Sensitive Hashing (LSH) family for the angular distance that yields an approximate Near Neighbor Search algorithm with the asymptotically optimal running time exponent. Unlike earlier algorithms with this property (e.g., Spherical LSH (Andoni-Indyk-Nguyen-Razensht...

Full description

Bibliographic Details
Main Authors: Andoni, Alexandr (Author), Laarhoven, Thijs (Author), Indyk, Piotr (Contributor), Razenshteyn, Ilya (Contributor), Schmidt, Ludwig (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Neural Information Processing Systems Foundation, 2018-02-20T21:04:45Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items