Evolving Computationally Efficient Hashing for Similarity Search.

Finding nearest neighbors in high-dimensional spaces is a very expensive task. Locality-sensitive hashing is a general dimension reduction technique that maps similar elements closely in the hash space, streamlining near neighbor lookup.