SuperMinHash - A New Minwise Hashing Algorithm for Jaccard Similarity Estimation
classification
💻 cs.DS
keywords
algorithmestimationjaccardsignaturessimilarityallowapproachbecause
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.