{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:11:16Z","timestamp":1747807876038},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292272"},{"type":"electronic","value":"9783540320876"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11563952_67","type":"book-chapter","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T11:24:50Z","timestamp":1129721090000},"page":"700-705","source":"Crossref","is-referenced-by-count":4,"title":["A Clustering Algorithm Based Absorbing Nearest Neighbors"],"prefix":"10.1007","author":[{"given":"Jian-jun","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang","family":"jie-Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang-an","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"An-long","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"67_CR1","first-page":"145","volume-title":"Data Mining Concepts and Techniques","author":"J.W. Han","year":"2001","unstructured":"Han, J.W., Kambr, M.: Data Mining Concepts and Techniques, pp. 145\u2013176. Higher Education Press, Beijing (2001)"},{"key":"67_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: an Introduction to Cluster Analysis","author":"L. Kaufan","year":"1990","unstructured":"Kaufan, L., Rousseeuw, P.J.: Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley & Sons, New York (1990)"},{"key":"67_CR3","first-page":"73","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"S. Guha","year":"1998","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: Haas, L.M., Tiwary, A. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 73\u201384. ACM Press, Seattle (1998)"},{"key":"67_CR4","first-page":"226","volume-title":"Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining","author":"M. Ester","year":"1996","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis, E., Han, J.W., Fayyad, U.M. (eds.) Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, pp. 226\u2013231. AAAI Press, Portland (1996)"},{"key":"67_CR5","first-page":"94","volume-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data","author":"R. Agrawal","year":"1998","unstructured":"Agrawal, R., Gehrke, J., Gunopolos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining application. In: Haas, L.M., Tiwary, A. (eds.) Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 94\u2013105. ACM Press, Seattle (1998)"},{"key":"67_CR6","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH:An Efficient Data Clustering Method for Very Large Database, Technical Report, Computer Sciences Dept., Univ.of Wisconsin-Madison (1995)","DOI":"10.1145\/233269.233324"},{"key":"67_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/233269.233324","volume-title":"Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data","author":"T. Zhang","year":"1996","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: Jagadish, H.V., Mumick, I.S. (eds.) Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 103\u2013114. ACM Press, Quebec (1996)"},{"key":"67_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K.S. Beyer","year":"1998","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., et al.: When is \u2018nearest neighbor\u2019 meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"issue":"8","key":"67_CR9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Han, E.H., Kumar, V.: CHAMELEON: a hierarchical clustering algorithm using dynamic modeling. IEEE Computer\u00a032(8), 68\u201375 (1999)","journal-title":"IEEE Computer"}],"container-title":["Lecture Notes in Computer Science","Advances in Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11563952_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:52:33Z","timestamp":1605642753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11563952_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292272","9783540320876"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11563952_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}