{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:11:03Z","timestamp":1763457063072},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540717003"},{"type":"electronic","value":"9783540717010"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71701-0_83","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T15:31:38Z","timestamp":1182353498000},"page":"761-768","source":"Crossref","is-referenced-by-count":26,"title":["BRIM: An Efficient Boundary Points Detecting Algorithm"],"prefix":"10.1007","author":[{"given":"Bao-Zhi","family":"Qiu","sequence":"first","affiliation":[]},{"given":"Feng","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Jun-Yi","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"83_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TKDE.2006.38","volume":"18","author":"C. Xia","year":"2006","unstructured":"Xia, C., Hsu, W., Lee, M.L., et al.: BODER: Efficient Computation of Boundary Points. IEEE transaction on knowledge and data engineering\u00a018(3), 289\u2013303 (2006)","journal-title":"IEEE transaction on knowledge and data engineering"},{"issue":"2","key":"83_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/276305.276312","volume":"27","author":"S. Guha","year":"1998","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large database. ACM SIGMOD Record\u00a027(2), 73\u201384 (1998)","journal-title":"ACM SIGMOD Record"},{"key":"83_CR3","unstructured":"Ester, M., Kriegel, H.-P., Sander, J.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), Portland, Oregon, pp. 226\u2013231 (1996)"},{"key":"83_CR4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/276304.276314","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"1998","unstructured":"Agrawal, R., Gunopulos, J.G.D., Raghavan, P.: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Seattle, Washington, pp. 94\u2013105. ACM, New York (1998)"},{"issue":"2","key":"83_CR5","first-page":"277","volume":"19","author":"Q. Baozhi","year":"2006","unstructured":"Baozhi, Q., Junyi, S.: A border-processing technique in grid-based clustering (in Chinese). Pattern recognition and artificial intelligence\u00a019(2), 277\u2013280 (2006)","journal-title":"Pattern recognition and artificial intelligence"},{"issue":"9","key":"83_CR6","first-page":"1011","volume":"21","author":"Q. Baozhi","year":"2006","unstructured":"Baozhi, Q., Junyi, S.: Grid-based and Extend-based Clustering Algorithm for Multi-density (in Chinese). Control and decsion\u00a021(9), 1011\u20131014 (2006)","journal-title":"Control and decsion"}],"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-71701-0_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T05:14:00Z","timestamp":1707974040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71701-0_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717003","9783540717010"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71701-0_83","relation":{},"subject":[]}}