I am learning about some techniques to find similarity between documents. One of the methods is Min Hashing. According to Min Hashing we can find a signature matrix given a random permutation, P. According to this technique in order to calculate signature matrix, we have to take the index of the first row in which document d has value 1.

Is it necessary to do that? If so, then can anyone please explain why? If not, can we take any nth row of boolean matrix permutation P?

  • $\begingroup$ The hash value should depend on the document somehow... MinHash has a relation to Jaccard similarity, see Wikipedia. If you use a different rule you won't necessarily get the same relation. $\endgroup$ – Yuval Filmus May 29 '19 at 14:30

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.