Given a minHash instance or minHash LSH , How to find most unsimilar instance with an existed minHash LSH?

[loulianzhang]

In API document , we can learn how to find approximate neighbours with Jaccard similarity more than threshold . On the other hand, how to find most unsimilar instance. Further, given a minHash LSH which initialized by thousands of plain text - set A, and given other thousands of plain text - set B, how to discover most unsimilar text of set B with set A , or how to discover text of set B which jaccard similarity less than threshold . Is there as possible as fast solution to deal with this problem ? Thanks !

[ekzhu]

For now MinHashLSH doesn't support dis-similarity search. Your usage scenario seems interesting. Can you describe it a bit more?

[ekzhu]

Thanks for asking. There may be some research works for this problem. MinHash LSH current can’t solve this problem. What’s your usage scenario?

…

On Sun, Aug 7, 2022 at 11:56 PM lzlou ***@***.***> wrote: In API document , we can learn how to find approximate neighbours with Jaccard similarity more than threshold . On the other hand, how to find most unsimilar instance. Further, given a minHash LSH which initialized by thousands of plain text - set A, and given other thousands of plain text - set B, how to discover most unsimilar text of set B with set A , or how to discover text of set B which jaccard similarity less than threshold . Is there as possible as fast solution to deal with this problem ? Thanks ! — Reply to this email directly, view it on GitHub <#189>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AACOGLS3MFTVONGRA5TC7WDVYCAO7ANCNFSM553UF32Q> . You are receiving this because you are subscribed to this thread.Message ID: ***@***.***>