1 min to read
Locality Sensitive Hashing (LSH)
Probabilistic way of finding similar set
Many problems can be expressed as finding similar sets. However, the naive way is so expensive when the number of documents is huge. Locality Sensitive Hashing(LSH) algorithm is one of the most popular way of resolving such problems. In this talk, we’ll study the main idea of LSH and how much it is effective.
Comments