Can I read On the Sample Complexity of Compressed Counting on EtoBox?

On the Sample Complexity of Compressed Counting by Li, Ping is a scholarly article available to read on EtoBox.

What is On the Sample Complexity of Compressed Counting about?

Compressed Counting (CC), based on maximally skewed stable random projections, was recently proposed for estimating the p-th frequency moments of data streams. The case p->1 is extremely useful for estimating Shannon entropy of data streams. In this study, we provide a very simple algorithm based on the sample minimum estimator and prove a much improved sample complexity bound, compared to prior results.

Author

Li, Ping

Published

2009

Language

EN