On Practical Algorithms for Entropy Estimation and the Improved Sample Complexity of Compressed Counting - Computer Science > Data Structures and AlgorithmsReport as inadecuate




On Practical Algorithms for Entropy Estimation and the Improved Sample Complexity of Compressed Counting - Computer Science > Data Structures and Algorithms - Download this document for free, or read online. Document in PDF available to download.

Abstract: Estimating the p-th frequency moment of data stream is a very heavily studiedproblem. The problem is actually trivial when p = 1, assuming the strictTurnstile model. The sample complexity of our proposed algorithm is essentiallyO1 near p=1. This is a very large improvement over the previously believedO1-eps^2 bound. The proposed algorithm makes the long-standing problem ofentropy estimation an easy task, as verified by the experiments included in theappendix.



Author: Ping Li

Source: https://arxiv.org/







Related documents