{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T13:15:59Z","timestamp":1737292559384,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725879"},{"type":"electronic","value":"9783540725886"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-72588-6_108","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T18:35:23Z","timestamp":1184610923000},"page":"629-636","source":"Crossref","is-referenced-by-count":1,"title":["Clustering Streaming Time Series Using CBC"],"prefix":"10.1007","author":[{"given":"Weimin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liangxu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiajin","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"108_CR1","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: Cure: An efficient clustering algorithm for large data-bases. In: ACM SIGMOD Conference (1998)","DOI":"10.1145\/276304.276312"},{"key":"108_CR2","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: Birch: An efficient data clustering method for very large databases. In: ACM SIGMOD Conference (1996)","DOI":"10.1145\/233269.233324"},{"key":"108_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, C., Han, J., Wang, J., Yu, P.S.: A Framework for Clustering Evolving Data Streams. In: Proc. 2003 Int. Conf. on Very Large Data Bases (VLDB\u201903), Berlin, Germany (2003)","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"108_CR4","volume-title":"Proceedings of the Annual Symposium on Foundations of Computer Science","author":"S. Guha","year":"2000","unstructured":"Guha, S., Mishra, N., Motwani, R., O\u2019Callaghan, L.: Clustering data streams. In: Proceedings of the Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos (2000)"},{"issue":"3","key":"108_CR5","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TKDE.2003.1198387","volume":"15","author":"S. Guha","year":"2003","unstructured":"Guha, S., Meyerson, A., Mishra, N., Motwani, R., O\u2019Callaghan, L.: Clustering Data Streams: Theory and Practice. IEEE Transactions on Knowledge and Data Engineering\u00a015(3), 515\u2013528 (2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"108_CR6","doi-asserted-by":"crossref","unstructured":"Keogh, E., Lin, J., Truppel, W.: Clustering of time series subsequences is meaningless: Implications for previous and future research. In: IEEE ICDE, pp. 115\u2013122 (2003)","DOI":"10.1109\/ICDM.2003.1250910"},{"issue":"2-3","key":"108_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10994-005-5825-6","volume":"58","author":"A. Bagnall","year":"2005","unstructured":"Bagnall, A., Janacek, G.: Clustering time series with clipped data. Machine Learning\u00a058(2-3), 151\u2013178 (2005)","journal-title":"Machine Learning"},{"key":"108_CR8","doi-asserted-by":"crossref","unstructured":"Lin, J., Keogh, E., Lonardi, S., Chiu, B.: A symbolic representation of time series, with implications for streaming algorithms. In: ACM SIGMOD Conference, pp. 2\u201311 (2003)","DOI":"10.1145\/882085.882086"},{"key":"108_CR9","unstructured":"Lkhagva, B., Suzuki, Y., Kawagoe, K.: Extended SAX: Extended of Symbolic Aggregate Approximation for Financial Time Series Data Representation. In: DEWS2006 (2006)"},{"key":"108_CR10","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast Subsequence Matching in Time-Series Databases. In: ACM SIGMOD Conference, pp. 419\u2013429 (1994)","DOI":"10.1145\/191843.191925"},{"key":"108_CR11","doi-asserted-by":"crossref","unstructured":"Chan, K., Fu, A.W.: Efficient Time Series Matching by Wavelets. In: IEEE ICDE, pp. 126\u2013133 (1999)","DOI":"10.1109\/ICDE.1999.754915"},{"key":"108_CR12","volume-title":"Data Mining- Concepts and Techniques","author":"J. Han","year":"2000","unstructured":"Han, J., Kamber, M.: Data Mining- Concepts and Techniques. Morgan Kaufmann, San Francisco (2000)"},{"key":"108_CR13","doi-asserted-by":"crossref","unstructured":"Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases. Journal of Knowledge and Information Systems (2000)","DOI":"10.1007\/PL00011669"},{"key":"108_CR14","unstructured":"O\u2019Callaghan, L., Mishra, N., Meyerson, A., Guha, S., Motwani, R.: Streaming-data algorithms for high quality clustering. In: IEEE ICDE (2002)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72588-6_108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:38:33Z","timestamp":1737290313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72588-6_108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725879","9783540725886"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72588-6_108","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}