Locality sensitive hashing and approximate nearest neighbors
Kent Quanrud · 71:09
This lecture develops locality-sensitive hashing (LSH) for high-dimensional approximate nearest neighbor search: instead of spreading keys apart, you design hashes so nearby points collide, then look only in the query...