{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:52:38Z","timestamp":1725558758101},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642305061"},{"type":"electronic","value":"9783642305078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30507-8_49","type":"book-chapter","created":{"date-parts":[[2012,6,2]],"date-time":"2012-06-02T02:29:57Z","timestamp":1338604197000},"page":"592-607","source":"Crossref","is-referenced-by-count":0,"title":["Resource-Aware Distributed Clustering of Drifting Sensor Data Streams"],"prefix":"10.1007","author":[{"given":"Marwan","family":"Hassani","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"crossref","unstructured":"Cao, F., Ester, M., Qian, W., Zhou, A.: Density-based clustering over an evolving data stream with noise. In: SDM, pp. 326\u2013337 (2006)","DOI":"10.1137\/1.9781611972764.29"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. In: Proc. ACM STOC, pp. 626\u2013635 (1997)","DOI":"10.1145\/258533.258657"},{"key":"49_CR3","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: Proc. SODA, pp. 642\u2013651 (2001)"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., O\u2019Callaghan, L., Panigrahy, R.: Better streaming algorithms for clustering problems. In: Proc. ACM STOC, pp. 30\u201339 (2003)","DOI":"10.1145\/780547.780548"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Y., Tu, L.: Density-based clustering for real-time stream data. In: KDD, pp. 133\u2013142 (2007)","DOI":"10.1145\/1281192.1281210"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S., Zhuang, W.: Conquering the divide: Continuous clustering of distributed data streams. In: Proc. IEEE ICDE, pp. 1036\u20131045 (2007)","DOI":"10.1109\/ICDE.2007.368962"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proc. ACM STOC, pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"issue":"2-3","key":"49_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoretical Computer Science\u00a038(2-3), 293\u2013306 (1985)","journal-title":"Theoretical Computer Science"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Guha, S.: Tight results for clustering and summarizing data streams. In: Proc. ICDT, pp. 268\u2013275 (2009)","DOI":"10.1145\/1514894.1514926"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Hassani, M., M\u00fcller, E., Seidl, T.: EDISKCO: energy efficient distributed in-sensor-network k-center clustering with outliers. In: Proc. SensorKDD 2009, pp. 39\u201348 (2009)","DOI":"10.1145\/1601966.1601975"},{"key":"49_CR11","unstructured":"Hassani, M., M\u00fcller, E., Spaus, P., Faqolli, A., Palpanas, T., Seidl, T.: Self-organizing energy aware clustering of nodes in sensor networks using relevant attributes. In: Proc. SensorKDD 2010, pp. 87\u201396 (2010)"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Hassani, M., Seidl, T.: Towards a mobile health context prediction: Sequential pattern mining in multiple streams. In: Proc. of IEEE MDM 2011, vol.\u00a02, pp. 55\u201357 (2011)","DOI":"10.1109\/MDM.2011.28"},{"key":"49_CR13","unstructured":"Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: Proc. HICSS (2000)"},{"key":"49_CR14","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Shmoys, D.B.: A best possible approximation algorithm for the k-centre problem. Math. of Operations Research\u00a010, 180\u2013184 (1985)","journal-title":"Math. of Operations Research"},{"key":"49_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-85363-3_14","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"R. Matthew McCutchen","year":"2008","unstructured":"Matthew McCutchen, R., Khuller, S.: Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 165\u2013178. Springer, Heidelberg (2008)"},{"issue":"4","key":"49_CR16","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1109\/TMC.2004.41","volume":"3","author":"S. Fahmy","year":"2004","unstructured":"Fahmy, S., Younis, O.: Heed: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Transactions on Mobile Computing\u00a03(4), 366\u2013379 (2004)","journal-title":"IEEE Transactions on Mobile Computing"}],"container-title":["Communications in Computer and Information Science","Networked Digital Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30507-8_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:43:33Z","timestamp":1620128613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30507-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642305061","9783642305078"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30507-8_49","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}