Github user jkbradley commented on the issue:
https://github.com/apache/spark/pull/15800
I disagree about this: you can do multiple probes with MinHash. For each
hash function, the probability of a collision is equal to the Jaccard
similarity coefficient: [https://en.wikipedia.org/wiki/MinHash]
Taking the average of these 0/1 collision indicators gives you an estimate
of the probability of a collision, which is exactly what multiple probing
needs. (This is why I suggested using a sum of indicators for hashDistance.)
Am I wrong?
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
