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, Laarhoven, Thijs, Indyk, Piotr, Razenshteyn, Ilya, Schmidt, Ludwig
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Neural Information Processing Systems Foundation 2018
Online Access:http://hdl.handle.net/1721.1/113844
https://orcid.org/0000-0002-7983-9524
https://orcid.org/0000-0002-3962-721X
https://orcid.org/0000-0002-9603-7056

Internet

http://hdl.handle.net/1721.1/113844
https://orcid.org/0000-0002-7983-9524
https://orcid.org/0000-0002-3962-721X
https://orcid.org/0000-0002-9603-7056

Similar Items