Locality Sensitive Hashing Search
Locality Sensitive Hashing Search Locality sensitive hashing, often abbreviated as LSH, is a search technique for approximate nearest neighbor queries. It uses hash functions that are designed so that similar objects are more likely to collide than dissimilar objects. You use it when exact nearest neighbor search is too expensive, especially in high dimensional spaces. Problem Given a dataset $D$ and a query object $q$, find items in $D$ that...