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.

Sign up for GitHub

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

Jump to bottom

deduplication #502

Open
SebastianJanampa opened this issue Feb 27, 2025 · 0 comments
Open

deduplication #502

SebastianJanampa opened this issue Feb 27, 2025 · 0 comments

Comments

@SebastianJanampa
Copy link

Hi,

Could you provide some information and code on how to do the deduplication? More specifically this part

Considering only neighbors with a similarity >0.6, we extract the connected components
of the associated k-NN graph thanks to a scalable disjoint set data structure implementation
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@SebastianJanampa