Skip to main content
SpringerLink
Log in

Estimating Entropy over Data Streams

  • Conference paper
Book cover Algorithms – ESA 2006 (ESA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4168))

Included in the following conference series:

Abstract

We present an algorithm for estimating entropy of data streams consisting of insertion and deletion operations using \(\tilde{O}(1)\) space.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and Issues in Data Stream Systems. In: Proc. of ACM PODS (2002)

    Google Scholar 

  2. Bhuvanagiri, L., Ganguly, S., Kesh, D., Saha, C.: Simpler algorithm for estimating frequency moments of data streams. In: Proc. of ACM SODA (2006)

    Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. 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)

    Google Scholar 

  5. Cormode, G., Muthukrishnan, S.: What’s Hot and What’s Not: Tracking Most Frequent Items Dynamically. In: Proc. of ACM PODS (May 2003)

    Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. 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)

    Chapter  Google Scholar 

  8. Gu, Y., McCallum, A., Towsley, D.: Detecting Anomalies in Network Traffic Using Maximum Entropy Estimation. In: Proc. of Internet Measurement Conference (2005)

    Google Scholar 

  9. Guha, S., McGregor, A., Venkatsubramanian, S.: Streaming and Sublinear Approximation of Entropy and Information Distances. In: Proc. of SODA (2006)

    Google Scholar 

  10. Indyk, P.: Stable Distributions, Pseudo Random Generators, Embeddings and Data Stream Computation. In: Proc. of IEEE FOCS (2000)

    Google Scholar 

  11. Indyk, P., Woodruff, D.: Optimal Approximations of the Frequency Moments. In: Proc. of ACM STOC (2005)

    Google Scholar 

  12. Muthukrishnan, S.: Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science 1(2) (2005)

    Google Scholar 

  13. Nisan, N.: Pseudo-Random Generators for Space Bounded Computation. In: Proc. of ACM STOC (1990)

    Google Scholar 

  14. Wagner, A., Plattner, B.: Entropy based worm and anomaly detection in fast IP networks. In: 14th IEEE WET ICE, STCA Security Workshop (2005)

    Google Scholar 

  15. Xu, K., Zhang, Z., Bhattacharyya, S.: Profiling internet backbone traffic: behavior models and applications. SIGCOMM Comput. Commun. Rev. 35(4) (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Technology, Kanpur

    Lakshminath Bhuvanagiri & Sumit Ganguly

Authors
  1. Lakshminath Bhuvanagiri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sumit Ganguly
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA and School of Computer Science, Tel-Aviv University, 69978, Tel-Aviv, Israel

    Yossi Azar

  2. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Thomas Erlebach

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation