1
$\begingroup$

Are there locality sensitive hashes that work nicely with sets? Each set would get a hash, the order of the elements in the set does not change the hash, and sets that share more elements are closer together.

Specifically, I am working with sets that each have approximately 10 elements, and there are a total of 1000000 unique elements across all sets (so creating a vector to binary encode the presence/absence of each element in each set is prohibitive).

Any direction to an algorithm for this would be much appreciated. Thank you very much for any guidance or feedback.

$\endgroup$
1
  • $\begingroup$ (I've seen locality sensitive hash function, and assumed a relation to memory hierarchy, too.) $\endgroup$
    – greybeard
    Feb 27, 2022 at 7:18

1 Answer 1

0
$\begingroup$

Yes. MinHash is one example of a locality sensitive hash for sets.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.