{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:59:55Z","timestamp":1725512395796},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681243"},{"type":"electronic","value":"9783540681250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68125-0_62","type":"book-chapter","created":{"date-parts":[[2008,5,10]],"date-time":"2008-05-10T07:40:05Z","timestamp":1210405205000},"page":"662-672","source":"Crossref","is-referenced-by-count":3,"title":["Connectivity Based Stream Clustering Using Localised Density Exemplars"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"L\u00fchr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Lazarescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Han, J., Wang, J., Yu, P.: A framework for clustering evolving data streams. In: Proc. 29th Int\u2019l Conf. Very Large Data Bases (2003)","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Han, J., Wang, J., Yu, P.S.: A framework for projected clustering of high dimensional data streams. In: Proc. Very Large Data Bases, pp. 852\u2013863 (2004)","DOI":"10.1016\/B978-012088469-8.50075-9"},{"key":"62_CR3","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. 2nd Int\u2019l Conf. Knowledge Discovery and Data Mining, pp. 226\u2013231 (1996)"},{"key":"62_CR4","doi-asserted-by":"crossref","unstructured":"Cao, F., Ester, M., Qian, W., Zhou, A.: Density-based clustering over an evolving data stream with noise. In: Proc. Sixth SIAM Int\u2019l Conf. Data Mining (2006)","DOI":"10.1137\/1.9781611972764.29"},{"key":"62_CR5","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Wimmer, M., Xu, X.: Incremental clustering for mining in a data warehousing environment. In: Proc. 24rd Int\u2019l Conf. Very Large Data Bases, pp. 323\u2013333 (1998)"},{"issue":"8","key":"62_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Han, E.H., Kumar, V.: Chameleon: Hierarchical clustering using dynamic modeling. Computer\u00a032(8), 68\u201375 (1999)","journal-title":"Computer"},{"issue":"1","key":"62_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/92.748202","volume":"7","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Aggarwal, R., Kumar, V., Shekhar, S.: Mutlilevel hypergraph partitioning: Application in VLSI domain. IEEE Trans. Very Large Scale Integration (VLSI) Systems\u00a07(1), 69\u201379 (1999)","journal-title":"IEEE Trans. Very Large Scale Integration (VLSI) Systems"},{"key":"62_CR8","unstructured":"Knuth, D.: The Art of Computer Programming, 3rd edn., vol.\u00a03 (1997)"},{"issue":"3","key":"62_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0168-1699(99)00046-0","volume":"24","author":"J.A. Blackard","year":"1999","unstructured":"Blackard, J.A., Dean, D.J.: Comparative accuracies of artificial neural networks and discriminant analysis in predicting forest cover types from cartographic variables. Computers and Electronics in Agriculture\u00a024(3), 131\u2013151 (1999)","journal-title":"Computers and Electronics in Agriculture"},{"issue":"4","key":"62_CR10","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/TKDE.2004.1269669","volume":"16","author":"C.C. Aggarwal","year":"2004","unstructured":"Aggarwal, C.C.: A human-computer interactive method for projected clustering. IEEE Trans. Knowledge and Data Engineering\u00a016(4), 448\u2013460 (2004)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"issue":"9","key":"62_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Mutlidimensional binary search trees used for associative searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"}],"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-540-68125-0_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:36:55Z","timestamp":1620016615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68125-0_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681243","9783540681250"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68125-0_62","relation":{},"subject":[]}}