On Practical Algorithms for Entropy Estimation and the Improved Sample Complexity of Compressed Counting

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Estimating the p-th frequency moment of data stream is a very heavily studied problem. The problem is actually trivial when p = 1, assuming the strict Turnstile model. The sample complexity of our proposed algorithm is essentially O(1) near p=1. This is a very large improvement over the previously believed O(1/eps^2) bound. The proposed algorithm makes the long-standing problem of entropy estimation an easy task, as verified by the experiments included in the appendix.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On Practical Algorithms for Entropy Estimation and the Improved 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 Practical Algorithms for Entropy Estimation and the Improved Sample Complexity of Compressed Counting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Practical Algorithms for Entropy Estimation and the Improved Sample Complexity of Compressed Counting will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-327769

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.