Superminhash - A New Minwise Hashing Algorithm For Jaccard Similarity Estimation

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.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyertl2017superminhash

Related papers

• Probminhash -- A Class Of Locality-sensitive Hash Algorithms For The (probability) Jaccard Similarity (2019)9.92
• Maximally Consistent Sampling And The Jaccard Index Of Probability Distributions (2018)0.00
• A Memory-efficient Sketch Method For Estimating High Similarities In Streaming Sets (2019)12.02
• Subsets And Supermajorities: Optimal Hashing-based Set Similarity Search (2019)5.84
• Differentially Private One Permutation Hashing And Bin-wise Consistent Weighted Sampling (2023)0.00
• Efficient Similarity Search In Dynamic Data Streams (2016)0.00
• Analysis Of Sparsehash: An Efficient Embedding Of Set-similarity Via Sparse Projections (2019)4.52
• Weighted Minwise Hashing Beats Linear Sketching For Inner Product Estimation (2023)3.58