Locality Sensitive Hashing using Euclidean Distance

It’s quite similar to Locality Sensitive Hashing (LSH) for Cosine Similarity which we covered earlier. I will be referring to the same here, so it’s better if you go through the same before proceeding. The difference lies in the way we compute hash value. As we have seen we can divide the region using planes. … Continue reading Locality Sensitive Hashing using Euclidean Distance