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 the return of MinHashLSH.query() in order #180

Open
charlotte-ling opened this issue Mar 22, 2022 · 2 comments
Open

Is the return of MinHashLSH.query() in order #180

charlotte-ling opened this issue Mar 22, 2022 · 2 comments
Labels

Comments

@charlotte-ling
Copy link

charlotte-ling commented Mar 22, 2022

Is the return of MinHashLSH.query() in ascend/descend order by Jaccard similarities

@bdeng3
Copy link

bdeng3 commented Apr 7, 2022

Same question here. I'm also wondering whether it is possible to get the estimated similarity if we use MinHashLSH.query(), instead of just knowing which keys are above the threshold.

@ekzhu
Copy link
Owner

ekzhu commented Jun 2, 2022

Is the return of MinHashLSH.query() in ascend/descend order by Jaccard similarities

It is currently not. You can sort it by computing the estimated Jaccard with MinHash. MinHashLSH should be the first step of the retrieval process to locate promising candidates, reducing the computation you need to spent in filtering and ranking the candidates.

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

No branches or pull requests

3 participants