LSH Algorithm and Implementation (E2LSH)

Locality-Sensitive Hashing (LSH) is an algorithm for solving the approximate or exact Near Neighbor Search in high dimensional spaces. This webpage links to the newest LSH algorithms in Euclidean and Hamming spaces, as well as the E2LSH package, an implementation of an early practical LSH algorithm.

Check out also the 2015--2016 FALCONN package, which is a package based on newer ideas (namely the NIPS'15 paper below).

This research was supported in part by NSF CAREER Grant #0133849 "Approximate Algorithms for High-dimensional Geometric Problems".