Abstract
We present an algorithm for estimating entropy of data streams consisting of insertion and deletion operations using \(\tilde{O}(1)\) space.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and Issues in Data Stream Systems. In: Proc. of ACM PODS (2002)
Bhuvanagiri, L., Ganguly, S., Kesh, D., Saha, C.: Simpler algorithm for estimating frequency moments of data streams. In: Proc. of ACM SODA (2006)
Chakrabarti, A., Ba, D.K., Muthukrishnan, S.: Estimating Entropy and Entropy Norm on Data Streams. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 196–205. Springer, Heidelberg (2006)
Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380. Springer, Heidelberg (2002)
Cormode, G., Muthukrishnan, S.: What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically. In: Proc. of ACM PODS (May 2003)
Cormode, G., Muthukrishnan, S.: An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 29–38. Springer, Heidelberg (2004)
Ganguly, S., Kesh, D., Saha, C.: Practical Algorithms for Tracking Database Join Sizes. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 297–309. Springer, Heidelberg (2005)
Gu, Y., McCallum, A., Towsley, D.: Detecting Anomalies in Network Traffic Using Maximum Entropy Estimation. In: Proc. of Internet Measurement Conference (2005)
Guha, S., McGregor, A., Venkatsubramanian, S.: Streaming and Sublinear Approximation of Entropy and Information Distances. In: Proc. of SODA (2006)
Indyk, P.: Stable Distributions, Pseudo Random Generators, Embeddings and Data Stream Computation. In: Proc. of IEEE FOCS (2000)
Indyk, P., Woodruff, D.: Optimal Approximations of the Frequency Moments. In: Proc. of ACM STOC (2005)
Muthukrishnan, S.: Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science 1(2) (2005)
Nisan, N.: Pseudo-Random Generators for Space Bounded Computation. In: Proc. of ACM STOC (1990)
Wagner, A., Plattner, B.: Entropy based worm and anomaly detection in fast IP networks. In: 14th IEEE WET ICE, STCA Security Workshop (2005)
Xu, K., Zhang, Z., Bhattacharyya, S.: Profiling internet backbone traffic: behavior models and applications. SIGCOMM Comput. Commun. Rev. 35(4) (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhuvanagiri, L., Ganguly, S. (2006). Estimating Entropy over Data Streams. In: Azar, Y., Erlebach, T. (eds) Algorithms – ESA 2006. ESA 2006. Lecture Notes in Computer Science, vol 4168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841036_16
Download citation
DOI: https://doi.org/10.1007/11841036_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38875-3
Online ISBN: 978-3-540-38876-0
eBook Packages: Computer ScienceComputer Science (R0)