Under Zipfian frequencies, Count-Min's expected error is Θ(k log(kn/B)/B), Count-Sketch gets its first nearly tight bounds, and learned Count-Sketch achieves Θ(1/B).
Heavy hitters via cluster-preserving clustering
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
(Learned) Frequency Estimation Algorithms under Zipfian Distribution
Under Zipfian frequencies, Count-Min's expected error is Θ(k log(kn/B)/B), Count-Sketch gets its first nearly tight bounds, and learned Count-Sketch achieves Θ(1/B).