{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:24:21Z","timestamp":1757543061912},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540250565"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32392-9_73","type":"book-chapter","created":{"date-parts":[[2006,5,27]],"date-time":"2006-05-27T07:09:20Z","timestamp":1148713760000},"page":"605-614","source":"Crossref","is-referenced-by-count":11,"title":["Faster Clustering with DBSCAN"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Skonieczny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"73_CR1","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M. et al. (1999) OPTICS: Ordering Points To Identify the Clustering Structure. SIGMOD, 49\u201360","DOI":"10.1145\/304182.304187"},{"key":"73_CR2","unstructured":"Bayer, R. (1997) The Universal B-Tree for Multidimensional Indexing. WWCA, 198\u2013209"},{"key":"73_CR3","unstructured":"Bayer, R. (1997) UB-Trees and UB-Cache, A new Processing Paradigm for Database Systems. Technical Report TUM-I9722"},{"key":"73_CR4","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P. (1990) The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD, 322\u2013331","DOI":"10.1145\/93597.98741"},{"key":"73_CR5","unstructured":"Ester, M., Kriegel, H.P. et al. (1996) A Density-Based Algorithm for Discovering Clusters in Large Spatial Database with Noise. KDD, 226\u2013231"},{"key":"73_CR6","doi-asserted-by":"crossref","unstructured":"Guttman, A. (1984) R-Trees: A Dynamic Index Structure For Spatial Searching. SIGMOD, 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"73_CR7","unstructured":"Han, J., Kamber, M. (2000) Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers"},{"key":"73_CR8","unstructured":"Hinneburg, A., Keim, D.A. (1998) An Efficient Approach to Clustering in Large Multimedia Databases with Noise. KDD, 58\u201365"},{"key":"73_CR9","doi-asserted-by":"crossref","unstructured":"Milenova, B.L., Campus, M.M. (2002) O-Cluster: Scalable Clustering of Large High Dimensional Data Set. ICDM, 290\u2013297","DOI":"10.1109\/ICDM.2002.1183915"},{"key":"73_CR10","unstructured":"Xu, X., Ester, M. et al. (1998) A Distribution-Based Clustering Algorithm for Mining in Large Spatial Databases. ICDE, 324\u2013331"}],"container-title":["Advances in Soft Computing","Intelligent Information Processing and Web Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32392-9_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:54:10Z","timestamp":1619571250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32392-9_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540250565"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-32392-9_73","relation":{},"subject":[]}}