SuperMinHash - A New Minwise Hashing Algorithm for Jaccard Similarity Estimation
Not on the map. Why?
Abstract (arXiv)
This paper presents a new algorithm for calculating hash signatures of sets which can be directly used for Jaccard similarity estimation. The new approach is an improvement over the MinHash algorithm, because it has a better runtime behavior and the resulting signatures allow a more precise estimation of the Jaccard index.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 18 Jun 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.