{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:11Z","timestamp":1725544571049},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_15","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"196-205","source":"Crossref","is-referenced-by-count":23,"title":["Estimating Entropy and Entropy Norm on Data Streams"],"prefix":"10.1007","author":[{"given":"Amit","family":"Chakrabarti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khanh","family":"Do Ba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proc. ACM STOC, pp. 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: ACM PODS, pp. 1\u201316 (2002)","DOI":"10.1145\/543613.543615"},{"key":"15_CR3","unstructured":"Coppersmith, D., Kumar, R.: An improved data stream algorithm for frequency moments. In: ACM-SIAM SODA, pp. 151\u2013156 (2004)"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G. Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms\u00a055(1), 58\u201375 (2005)","journal-title":"J. Algorithms"},{"issue":"3","key":"15_CR5","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/859716.859719","volume":"21","author":"C. Estan","year":"2003","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Trans. Comput. Syst.\u00a021(3), 270\u2013313 (2003)","journal-title":"ACM Trans. Comput. Syst."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Gu, Y., McCallum, A., Towsley, D.: Detecting Anomalies in Network Traffic Using Maximum Entropy Estimation. In: Proc. Internet Measurement Conference (2005)","DOI":"10.1145\/1330107.1330148"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Guha, S., McGregor, A., Venkatasubramanian, S.: Streaming and Sublinear Approximation of Entropy and Information Distances. In: ACM-SIAM SODA (to appear, 2006)","DOI":"10.1145\/1109557.1109637"},{"key":"15_CR8","unstructured":"Indyk, P.: Personal e-mail communication (September 2005)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Indyk, P., Woodruff, D.: Optimal approximations of the frequency moments of data streams. In: ACM STOC, pp. 202\u2013208 (2005)","DOI":"10.1145\/1060590.1060621"},{"key":"15_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"15_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"15_CR12","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications. Manuscript, Available online at: \n                  \n                    http:\/\/www.cs.rutgers.edu\/~muthu\/stream-1-1.ps"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Wagner, A., Plattner, B.: Entropy Based Worm and Anomaly Detection in Fast IP Networks. In: 14th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (WET ICE). STCA security workshop, Linkping, Sweden (June 2005)","DOI":"10.1109\/WETICE.2005.35"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Xu, K., Zhang, Z., Bhattacharya, S.: Profiling Internet Backbone Traffic: Behavior Models and Applications. In: Proc. ACM SIGCOMM (2005)","DOI":"10.1145\/1080091.1080112"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T11:14:59Z","timestamp":1548414899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11672142_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}