Estimating entropy and entropy norm on data streams

Internet Mathematics

Volumn 3, Issue 1, 2006, Pages 63-78

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

^a DARTMOUTH COLLEGE   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79953650863     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2006.10129117     Document Type: Article

References (18)

1. N. Alon, Y. Matias and M. Szegedy. “The Space Complexity of Approximating the Frequency Moments.” In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 20–29. New York: ACM Press, 1996.
2. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. “Models and Issues in Data Stream Systems.” In Proceedings of the Twenty-First ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 1–16. New York: ACM Press, 2002.
3. R. Boyer and J. Moore. “MJRTY—A Fast Majority Vote Algorithm.” Technical Report ICSCA-CMP-32, Institute for Computing Science and Computer Applications, University of Texas at Austin, 1982.
4. D. Coppersmith and R. Kumar. “An Improved Data Stream Algorithm for Frequency Moments.” In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 151–156. Philadelphia: SIAM, 2004.
5. Graham Cormode, Theodore Johnson, Flip Korn, S. Muthukrishnan, Oliver Spatscheck, and Divesh Srivastava. “Holistic UDAFs at Streaming Speeds.” In Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, pp. 35–46. New York: ACM Press, 2004.
6. G. Cormode and S. Muthukrishnan. “An Improved Data Stream Summary: The Count-Min Sketch and Its Applications.” J. Algorithms 55:1 (2005), 58–75.
7. Charles D. Cranor, Theodore Johnson, Oliver Spatscheck, and Vladislav Shkapenyuk. “The Gigascope Stream Database.” IEEE Data Eng. Bull. 26:1 (2003), 27–32.
8. 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 (2003), 270–313.
9. Y. Gu, A. McCallum and D. Towsley. “Detecting Anomalies in Network Traffic Using Maximum Entropy Estimation.” In Proceedings of the Internet Measurement Conference. Available from the World Wide Web (http://www.usenix.org/events/imc05/tech/qu.html), 2005.
10. S. Guha, A. McGregor, and S. Venkatasubramanian. “Streaming and Sublinear Approximation of Entropy and Information Distances.” In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 733–742. New York: ACM Press, 2006.
11. P. Indyk. Personal e-mail communication. September 2005.
12. P. Indyk and D. Woodruff. “Optimal Approximations of the Frequency Moments of Data Streams.” In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 202–208. New York: ACM Press, 2005.
13. T. Johnson, S. Muthukrishnan, and I. Rozenbaum. “Sampling Algorithms in a Stream Operator.” In Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 1–12. New York: ACM Press, 2005.
14. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge, UK: Cambridge University Press, 1997.
15. R. Motwani and P. Raghavan. Randomized Algorithms. New York: Cambridge University Press, 1995.
16. S. Muthukrishnan. “Data Streams: Algorithms and Applications.” Manuscript. Available from World Wide Web (http://www.cs.rutgers.edu/ ∼muthu/stream-1-1.ps), 2006.
17. A. Wagner and B. Plattner. “Entropy Based Worm and Anomaly Detection in Fast IP Networks.” In 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise, pp. 172–177. Los Alamitos, CA: IEEE Press, 2005.
18. K. Xu, Z. Zhang, and S. Bhattacharya. “Profiling Internet Backbone Traffic: Behavior Models and Applications.” In Proceedings of the 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 169–180. New York: ACM Press, 2005.