{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:58:43Z","timestamp":1725559123445},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260325"},{"type":"electronic","value":"9783540321118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428831_122","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T04:14:05Z","timestamp":1279080845000},"page":"979-986","source":"Crossref","is-referenced-by-count":1,"title":["Density-Based Spatial Outliers Detecting"],"prefix":"10.1007","author":[{"given":"Tianqiang","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolin","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chongcheng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinmin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"122_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-3994-4","volume-title":"Identification of Outliers","author":"D. Hawkins","year":"1980","unstructured":"Hawkins, D.: Identification of Outliers. Chapman and Hall, London (1980)"},{"key":"122_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/b97861","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H. Dai","year":"2004","unstructured":"Dai, H., Srikant, R., Zhang, C.: OBE: Outlier by example. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 222\u2013234. Springer, Heidelberg (2004)"},{"issue":"2","key":"122_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1023455925009","volume":"7","author":"S. Shekhar","year":"2003","unstructured":"Shekhar, S., Lu, C.T., Zhang, P.: A unified approach to detecting spatial outliers. GeoInformatica\u00a07(2), 139\u2013166 (2003)","journal-title":"GeoInformatica"},{"key":"122_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1109\/ICDM.2003.1250986","volume-title":"Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003)","author":"C.T. Lu","year":"2003","unstructured":"Lu, C.T., Chen, D., Kou, Y.: Algorithms for spatial outlier detection. In: Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), Melbourne, Florida, USA, December 19-22, pp. 597\u2013600. IEEE Computer Society, Los Alamitos (2003)"},{"unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases. In: Proceedings of KDD 1996, Portland OR, USA, pp. 226\u2013231 (1996)","key":"122_CR5"},{"issue":"2","key":"122_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1009745219419","volume":"2","author":"J. Sander","year":"1998","unstructured":"Sander, J., Ester, M., Kriegel, H., Xu, X.: Density-based Clustering in Spatial Databases: the algorithm GDBSCAN and its applications. Data Mining and Knowledge Discovery\u00a02(2), 169\u2013194 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"doi-asserted-by":"crossref","unstructured":"Breunig, M.M., Kriegel, H.P., Ng, R.T., Sander, J.: LOF: Identifying density-based local outliers. In: Proceedings of SIGMOD 2000, Dallas, Texas, pp. 427\u2013438 (2000)","key":"122_CR7","DOI":"10.1145\/342009.335388"},{"issue":"2","key":"122_CR8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N. Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD Record\u00a019(2), 322\u2013331 (1990)","journal-title":"SIGMOD Record"},{"issue":"2","key":"122_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1145\/253262.253347","volume":"26","author":"N. Katayama","year":"1997","unstructured":"Katayama, N., Satoh, S.: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. SIGMOD Record\u00a026(2), 369\u2013380 (1997)","journal-title":"SIGMOD Record"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428831_122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T18:05:00Z","timestamp":1552759500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428831_122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260325","9783540321118"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11428831_122","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}