Y
Hacker News
new
|
ask
|
show
|
jobs
by
gpderetta
717 days ago
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?