Skip to content
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

Is it possible to query results based on threshold. #26

Open
tom-riddle opened this issue Jul 28, 2018 · 3 comments
Open

Is it possible to query results based on threshold. #26

tom-riddle opened this issue Jul 28, 2018 · 3 comments

Comments

@tom-riddle
Copy link

Many LSH implementations use Jaccard similarity to return matching result above a certain threshold say 80% match.
Is possible to implement the same in this library.

@Riroaki
Copy link

Riroaki commented Jul 17, 2019

Same thoughts.
And I think zipping arrays into lower dimensions and using smaller input_dim may help, as smaller dimensions increases the probability of collision, and therefore similar vectors are more likely fall into a same slot.

@Riroaki
Copy link

Riroaki commented Jul 17, 2019

Same thoughts.
And I think zipping arrays into lower dimensions and using smaller input_dim may help, as smaller dimensions increases the probability of collision, and therefore similar vectors are more likely fall into a same slot.

Sorry, I mean hash_size..

@AmeerahAlshahrani
Copy link

Many LSH implementations use Jaccard similarity to return matching result above a certain threshold say 80% match. Is possible to implement the same in this library.

How to use threshold with this LSH implementation can you help me I have problem with this issue

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants