Learn in 5 Minutes: Finding Nearest Neighbor using MinHash

Learn about the MinHash technique, and how to apply it for approximately finding the closest neighbors in a very large set of documents.

Steps include shingling, generating the minhash signature, and finally applying locality sensitive hashing to find overlapping segments.

[theepicturtleman]

These video’s are so underrated man. You definitely need more views. This stuff is so interesting

[boragokbakan]

Very nice overview! I think there is a small error for the last element of the signature of the second document, the first non-zero shingle is 2, but not 3.

[MRsimsan]

Great Video! Just the explanation of LSH is a bit short.