{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:08:29Z","timestamp":1725556109027},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642136719"},{"type":"electronic","value":"9783642136726"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13672-6_34","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T10:38:17Z","timestamp":1274179097000},"page":"343-353","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Trade-Off between Speed Processing and Accuracy in Summarizing Data Streams"],"prefix":"10.1007","author":[{"given":"Nesrine","family":"Gabsi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Cl\u00e9rot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georges","family":"H\u00e9brail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Han, J., Wang, J., Yu, P.S.: A framework for clustering evolving data streams. In: VLDB, pp. 81\u201392 (2003)","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Cormode, G., Garofalakis, M.N.: Sketching probabilistic data streams. In: SIGMOD Conference, pp. 281\u2013292 (2007)","DOI":"10.1145\/1247480.1247513"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Cormode, G., Korn, F., Tirthapura, S.: Exponentially decayed aggregates on data streams. In: International Conference on Data Engineering, pp. 1379\u20131381 (2008)","DOI":"10.1109\/ICDE.2008.4497562"},{"key":"34_CR4","unstructured":"Csernel, B.: R\u00e9sum\u00e9 g\u00e9n\u00e9raliste de flux de donn\u00e9es. PhD thesis, Ecole Nationale Sup\u00e9rieur des T\u00e9l\u00e9communications (February 2008)"},{"key":"34_CR5","unstructured":"Csernel, B., Cl\u00e9rot, F., H\u00e9brail, G.: Streamsamp: Datastream clustering over tilted windows through sampling. In: ECML PKDD 2006 Workshop on Kbowledge Discovery from Data Streams (2006)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Cuzzocrea, A., Furfaro, F., Mazzeo, G.M., Sacca, D.: A grid framework for approximate aggregate query answering on summarized sensor network readings. In: Proc. of the 1st International Workshop on Grid Computing and its Application to Data Analysis (2004)","DOI":"10.1007\/978-3-540-30470-8_32"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Gemulla, R., Lehner, W.: Sampling time-based sliding windows in bounded space. In: SIGMOD Conference, pp. 379\u2013392 (2008)","DOI":"10.1145\/1376616.1376657"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/776985.776986","volume":"32","author":"L. Golab","year":"2003","unstructured":"Golab, L., Tamer \u00d6zsu, M.: Issues in data stream management. SIGMOD Record\u00a032, 5\u201314 (2003)","journal-title":"SIGMOD Record"},{"key":"34_CR9","unstructured":"Guha, S., Shim, K.: Offline and data stream algorithms for efficient computation of synopsis structures. In: VLDB \u201905, p. 1364. VLDB Endowment (2005)"},{"key":"34_CR10","unstructured":"Mahalanobis, P.C.: On the generalised distance in statistics. In: Proceedings National Institute of Science, India, April 1936, vol.\u00a02, pp. 49\u201355 (1936)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Rueda, L.: An efficient algorithm for optimal multilevel thresholding of irregularly sampled histograms. In: SSPR\/SPR, pp. 602\u2013611 (2008)","DOI":"10.1007\/978-3-540-89689-0_64"},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T. Zhang","year":"1996","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: Birch: an efficient data clustering method for very large databases. SIGMOD Rec.\u00a025(2), 103\u2013114 (1996)","journal-title":"SIGMOD Rec."}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13672-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:50:26Z","timestamp":1558277426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13672-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136719","9783642136726"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13672-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}