Streaming algorithms for estimating entropy

2008 IEEE Information Theory Workshop, ITW

Volumn , Issue , 2008, Pages 227-231

  Harvey, Nicholas J A ^a   Nelson, Jelani ^a   Onak, Krzysztof ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CYBERNETICS; INFORMATION THEORY; RHENIUM;

NEW RESULTS; QUANTITATIVE BOUNDS; RATE OF CONVERGENCE; SHANNON ENTROPIES; STREAMING ALGORITHMS; STREAMING MODEL;

ENTROPY;

EID: 51849161900     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2008.4578656     Document Type: Conference Paper

References (19)

1. N. Alon, Y. Matias, and M. Szegedy. The Space Complexity of Approximating the Frequency Moments. Journal of Computer and System Sciences, 58(1):137-147, 1999.
2. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences, 68(4):702-732, 2004.
3. L. Bhuvanagiri and S. Ganguly. Estimating entropy over data streams. In Proceedings of the 14th Annual European Symposium on Algorithms, pages 148-159, 2006.
4. I. Budimir, S. Dragomir, and J. Pěcaríc. Further Reverse Results for Jensen's Discrete Inequality and Applications in Information Theory. Journal of Inequalities in Pure and Applied Mathematics, 2(1), 2001.
5. A. Chakrabarti, G. Cormode, and A. McGregor. A near-optimal algorithm for computing the entropy of a stream. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 328-335, 2007.
6. A. Chakrabarti, K. Do Ba, and S. Muthukrishnan. A near-optimal algorithm for computing the entropy of a stream. In Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 196-205, 2006.
7. T. Cover and J. Thomas. Elements of Information Theory. Wiley Interscience, 1991.
8. S. Dragomir. On some inequalities for the Renyi α -entropy. Revista de Matematica e Estatistica, 19:349-362, 2001.
9. S. Guha, A. McGregor, and S. Venkatasubramanian. Streaming and sublinear approximation of entropy and information distances. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 733-742, 2006.
10. P. Indyk. Stable distributions, pseudorandom generators, embeddings, and data stream computation. Journal of the ACM, 53(3):307-323, 2006.
11. P. Indyk and D. P. Woodruff. Optimal approximations of the frequency moments of data streams. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pages 202-208, 2005.
12. A. Lakhina, M. Crovella, and C. Diot. Mining anomalies using traffic feature distributions. In Proceedings of the ACM SIGCOMM Conference, pages 217-228, 2005.
13. α (0 < α ≤ 2) Using Stable Random Projections. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008.
14. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science, 1(2):117-236, 2005.
15. W. Rudin. Principles of Mathematical Analysis. McGraw-Hill, third edition, 1976.
16. M. E. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 360-369, 2002.
17. K. Xu, Z.-L. Zhang, and S. Bhattacharyya. Profiling internet backbone traffic: behavior models and applications. In Proceedings of the ACM SIGCOMM Conference, pages 169-180, 2005.
18. H. Zhao, A. Lall, M. Ogihara, O. Spatscheck, J. Wang, and J. Xu. A Data Streaming Algorithm for Estimating Entropies of OD Flows. In Proceedings of the Internet Measurement Conference (IMC), 2007.
19. K. Z̈yczkowski. Rényi Extrapolation of Shannon Entropy. Open Systems & Information Dynamics, 10(3):297-310, 2003.