You can use min hash to avoid the full O(N^2) distance matrix, but with just 600...

gpderetta 7 months ago | parent | context | favorite | on: Finding near-duplicates with Jaccard similarity an...

You can use min hash to avoid the full O(N^2) distance matrix, but with just 600000 items you might just brute force compute the full matrix for simiplicity. What's your time budget?