SuperMinHash - A New Minwise Hashing Algorithm for Jaccard Similarity Estimation
Data Structures and Algorithms
2017-06-20 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1706.05698,
title = {SuperMinHash - A New Minwise Hashing Algorithm for Jaccard Similarity Estimation},
author = {Otmar Ertl},
journal= {arXiv preprint arXiv:1706.05698},
year = {2017}
}
Comments
6 pages, 2 figures