-
Notifications
You must be signed in to change notification settings - Fork 346
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Using the MinHasher #609
Comments
The process is right. I haven't read your code in detail but on a quick scan it looks right. The similarity here is fairly low (I'm used to trying to match jaccard similarities closer to the 0.8 or 0.9 range) but you do have the threshold set quite low as well, so it should work. Have you:
|
Hi, thanks for your reply. I tested the algorithm with two identical profiles, and they map in the same buckets! Thanks for the hint. So I think I have made an error in the process of mapping (profile, [buckets]) to (bucket, [profile]) EDIT:
|
Hi,
I'm trying to use MinHasher to compute LSH using differents profiles, each profiles has a list of tokens (a bag of words).
If I understand right the process to do is:
Is this process correct?
Because I tried it, but it never produces colliding buckets, I mean each bucket contains always a single profile.
This is my testing code
And this is the output
The text was updated successfully, but these errors were encountered: