Nelson Elhage personal blog

Finding near-duplicates with Jaccard similarity and MinHash

How do you find near-duplicates in a massive collection of documents? An exploration of the Jaccard similarity metric, and the MinHash hashing trick used to efficiently approximate it at web scale.
Points
247
HN comments
36
Submissions
1
Cited by
0 commenters

Databases & DataMath & Algorithms2024

On Hacker News

SubmittedTitle on HNPointsComments
Jul 4, 2024Finding near-duplicates with Jaccard similarity and MinHash by brianyu824736

More from Nelson Elhage

All 19 posts →

Related posts from the same era