{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:19Z","timestamp":1725487159090},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_28","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:42:44Z","timestamp":1183549364000},"page":"284-296","source":"Crossref","is-referenced-by-count":1,"title":["Geometric Algorithms for Density-Based Data Clustering"],"prefix":"10.1007","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, D. Eppstein, and J. Matou\u0161ek, Dynamic half-space reporting, geometric optimization, and minimum spanning trees, Proc. 33rd Annual IEEE Symp. Found. Comput. Sci., 1992, pp. 80\u201389.","DOI":"10.1109\/SFCS.1992.267816"},{"key":"28_CR2","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"P.K. Agarwal","year":"1999","unstructured":"P.K. Agarwal and J. Erickson, Geometric range searching and its relatives. In: B. Chazelle, J.E. Goodman and R. Pollack (Eds.), Advances in Discrete and Computational Geometry, American Mathematical Society, Providence, RI, 1999, pp. 1\u201356."},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0925-7721(00)00022-5","volume":"17","author":"S. Arya","year":"2000","unstructured":"S. Arya and D. M. Mount, Approximate range searching, Comput. Geom. Theory Appl., 17 (2000), pp. 135\u2013152.","journal-title":"Comput. Geom. Theory Appl."},{"key":"28_CR4","unstructured":"S. Arya and D.M. Mount, ANN: A library for approximate nearest neighbor searching, 2nd CGC Workshop on Computational Geometry, 1997. lso, see http:\/\/www.cs.umd.edu\/~mount\/ ."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"S. Arya, D.M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu, An optimal algorithm for approximate nearest neighbor searching in fixed dimensions, J. ACM, 45 (1998), pp. 891\u2013923.","journal-title":"J. ACM"},{"key":"28_CR6","unstructured":"M. Ester, H.-P. Kriegel, J. Sander, M. Wimmer, and X. Xu, Incremental clustering for mining in a data warehousing environment, Proc. 24th Int. Conf. on Very Large Databases, 1998, pp. 323\u2013333."},{"key":"28_CR7","unstructured":"M. Ester, H.P. Kriegel, J. Sander, and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, 1996, pp. 226\u2013231."},{"key":"28_CR8","unstructured":"A.K. Jain and R. C. Dubes, Algorithms for Clustering Data, Prentice Hall, 1988."},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/BF01553907","volume":"4","author":"R. Klein","year":"1989","unstructured":"R. Klein, O. Nurmi, T. Ottmann, and D. Wood, A dynamic fixed windowing problem, Algorithmica, 4 (1989), pp. 535\u2013550.","journal-title":"Algorithmica"},{"issue":"2","key":"28_CR10","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1009745219419","volume":"2","author":"J. Sander","year":"1998","unstructured":"J. Sander, M. Ester, H.-P. Kriegel, and X. Xu, Density-based clustering in spatial databases: The algorithm GDBSCAN and its application, Data Mining and Knowledge Discovery, 2 (2) (1998), pp. 169\u2013194.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"B. Zhou, D.W. Cheung, and B. Kao, A fast algorithm for density-based clustering in large database, Proc. 3rd Pacific-Asia Conf. on Methodologies for Knowledge Discovery and Data Mining, 1999, pp. 338\u2013349.","DOI":"10.1007\/3-540-48912-6_45"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T23:06:11Z","timestamp":1556579171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}