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. In each region we can have data-points.
Follow these steps (refer to diagram)
1. Divide the plane into small parts.
2. Project each data-point on the planes.
3. For each datapoint take the distance along each plane and use it to calculate the hash value.
Rest of the procedure is similar to cosine similarity process. Like finding the nearest neighbor.