# SuperMinHash - A New Minwise Hashing Algorithm for Jaccard Similarity Estimation

arXiv: https://arxiv.org/abs/1706.05698 · HTML: https://mlsanity.com/paper/1706.05698/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Jun 2017.

## Built on by (most cited first, 1 of 1)

- [Sampling-Based Estimation of Jaccard Containment and Similarity](https://mlsanity.com/paper/2507.10019/) (2025)

## 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.