On the Sample Complexity of Compressed Counting

Details On the Sample Complexity of Compressed Counting On the Sample Complexity of Compressed Counting

2009-10-08

arxiv.org/abs/0910.1403v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Sample Complexity of Compressed Counting does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Sample Complexity of Compressed Counting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Sample Complexity of Compressed Counting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352315