A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting

2008/08/13 by Li, Ping
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.0808.1771

Abstract

Compressed Counting (CC) was recently proposed for approximating the αth frequency moments of data streams, for 0

Related

• Estimating Entropy of Data Streams Using Compressed Counting
• Improving Compressed Counting
• On the Sample Complexity of Compressed Counting
• On Practical Algorithms for Entropy Estimation and the Improved Sample Complexity of Compressed Counting
• The Optimal Quantile Estimator for Compressed Counting