Estimating entropy and entropy norm on data streams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3884 LNCS, Issue , 2006, Pages 196-205

  Chakrabarti, Amit ^a   Do Ba, Khanh ^a   Muthukrishnan, S ^b  

^a Dartmouth Department of Computer Science_Dartmouth College   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA PROCESSING; ESTIMATION;

DATA STREAMS; ENTROPY NORM; FREQUENCY MOMENTS; POLYLOGARITHMIC SPACE;

ENTROPY;

EID: 33745622105     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_15     Document Type: Conference Paper

References (14)

1. N. Alon, Y. Matias and M. Szegedy. The space complexity of approximating the frequency moments. Proc. ACM STOC, 20-29, 1996.
2. B. Babcock, S. Babu, M. Datar, R. Motwani and J. Widom. Models and issues in data stream systems. ACM PODS, 2002, 1-16.
3. D. Coppersmith and R. Kumar. An improved data stream algorithm for frequency moments. ACM-SIAM SODA, 151-156, 2004.
4. G. Cormode and S. Muthukrishnan. An improved data stream summary: the countmin sketch and its applications. J. Algorithms, 55(1): 58-75, April 2005.
5. C. Estan and G. Varghese. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Trans. Comput. Syst., 21(3): 270-313, 2003.
6. Y. Gu, A. McCallum and D. Towsley. Detecting Anomalies in Network Traffic Using Maximum Entropy Estimation. Proc. Internet Measurement Conference, 2005.
7. S. Guha, A. McGregor, and S. Venkatasubramanian. Streaming and Sublinear Approximation of Entropy and Information Distances. ACM-SIAM SODA, to appear, 2006.
8. P. Indyk. Personal e-mail communication. September 2005.
9. P. Indyk and D. Woodruff. Optimal approximations of the frequency moments of data streams. ACM STOC, 202-208, 2005.
10. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, Cambridge, 1997.
11. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1995.
12. S. Muthukrishnan. Data Streams: Algorithms and Applications. Manuscript, Available online at http://www.cs.rutgers.edu/~muthu/stream-1-1.ps
13. A. Wagner and B. Plattner Entropy Based Worm and Anomaly Detection in Fast IP Networks. 14th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (WET ICE), STCA security workshop, Linkping, Sweden, June, 2005
14. K. Xu, Z. Zhang, and S. Bhattacharya. Profiling Internet Backbone Traffic: Behavior Models and Applications. Proc. ACM SIGCOMM 2005.