Search Results for author:
Found 6 papers, 6 papers with code
ProbMinHash -- A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
This paper introduces a class of one-pass locality-sensitive hash algorithms that are orders of magnitude faster than the original approach.
Computing Extremely Accurate Quantiles Using t-Digests
We present on-line algorithms for computing approximations of rank-based statistics that give high accuracy, particularly near the tails of a distribution, with very small sketches.
Sequential Quantile Estimation
Computation
Data Structures and Algorithms
BagMinHash - Minwise Hashing Algorithm for Weighted Sets
Minwise hashing has become a standard tool to calculate signatures which allow direct estimation of Jaccard similarities.
Data Structures and Algorithms
New Cardinality Estimation Methods for HyperLogLog Sketches
This work presents new cardinality estimation methods for data sets recorded by HyperLogLog sketches.
Data Structures and Algorithms
SuperMinHash - A New Minwise Hashing Algorithm for Jaccard Similarity Estimation
This paper presents a new algorithm for calculating hash signatures of sets which can be directly used for Jaccard similarity estimation.
Data Structures and Algorithms
New cardinality estimation algorithms for HyperLogLog sketches
This paper presents new methods to estimate the cardinalities of data sets recorded by HyperLogLog sketches.
Data Structures and Algorithms 68W15, 68W25, 62-07 E.1; I.1.2; H.2.8
