{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:51Z","timestamp":1740099051895,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319920122"},{"type":"electronic","value":"9783319920139"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92013-9_23","type":"book-chapter","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T08:57:09Z","timestamp":1526547429000},"page":"288-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["DistClusTree: A Framework for Distributed Stream Clustering"],"prefix":"10.1007","author":[{"given":"Zhinoos","family":"Razavi Hesabi","sequence":"first","affiliation":[]},{"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[]},{"given":"Kewen","family":"Liao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"key":"23_CR1","first-page":"1601","volume":"11","author":"A Bifet","year":"2010","unstructured":"Bifet, A., Holmes, G., Kirkby, R., Pfahringer, B.: MOA: massive online analysis. J. Mach. Learn. Res. 11, 1601\u20131604 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S., Zhuang, W.: Conquering the divide: continuous clustering of distributed data streams. In: 2007 IEEE 23rd International Conference on Data Engineering, pp. 1036\u20131045, April 2007","DOI":"10.1109\/ICDE.2007.368962"},{"key":"23_CR3","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD 1996, pp. 226\u2013231. AAAI Press (1996)"},{"issue":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"Antonin Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching, vol. 14. ACM (1984)","journal-title":"ACM SIGMOD Record"},{"key":"23_CR5","unstructured":"Januzaj, E., Kriegel, H.-P., Pfeifle, M.: Towards effective and efficient distributed clustering. In: Workshop on Clustering Large Data Sets ICDM, pp. 49\u201358 (2003)"},{"key":"23_CR6","first-page":"2001","volume":"3","author":"H Kargupta","year":"1999","unstructured":"Kargupta, H., Huang, W., Sivakumar, K., Johnson, E.: Distributed clustering using collective principal component analysis. Knowl. Inf. Syst. 3, 2001 (1999)","journal-title":"Knowl. Inf. Syst."},{"key":"23_CR7","unstructured":"Klusch, M., Lodi, S., Moro, G.: Distributed clustering based on sampling local density estimates. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, IJCAI 2003, pp. 485\u2013490. Morgan Kaufmann Publishers Inc., San Francisco (2003)"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10115-010-0342-8","volume":"29","author":"P Kranen","year":"2011","unstructured":"Kranen, P., Assent, I., Baldauf, C., Seidl, T.: The clustree: indexing micro-clusters for anytime stream mining. Knowl. Inf. Syst. 29(2), 249\u2013272 (2011)","journal-title":"Knowl. Inf. Syst."},{"issue":"01","key":"23_CR9","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1002\/widm.1109","volume":"4","author":"PP Rodrigues","year":"2014","unstructured":"Rodrigues, P.P., Gama, J.: Distributed clustering of ubiquitous data streams. Wiley Interdisc. Rev. Data Mining Knowl. Disc. 4(01), 38\u201354 (2014)","journal-title":"Wiley Interdisc. Rev. Data Mining Knowl. Disc."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity indexing with the SS-tree. In: Proceedings of the Twelfth International Conference on Data Engineering, pp. 516\u2013523, February 1996","DOI":"10.1109\/ICDE.1996.492202"},{"issue":"2","key":"23_CR11","first-page":"12","volume":"8","author":"K Yi","year":"2012","unstructured":"Yi, K., Zhang, Q.: Multidimensional online tracking. ACM Trans. Algorithms (TALG) 8(2), 12 (2012)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Zhou, A., Cao, F., Yan, Y., Sha, C., He, X.: Distributed data stream clustering: a fast EM-based approach. In: 2007 IEEE 23rd International Conference on Data Engineering, pp. 736\u2013745, April 2007","DOI":"10.1109\/ICDE.2007.367919"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92013-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T09:04:12Z","timestamp":1526547852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92013-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319920122","9783319920139"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92013-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}