{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:09:24Z","timestamp":1772021364339,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425342","type":"print"},{"value":"9783540447948","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44794-6_29","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:37:34Z","timestamp":1184603854000},"page":"350-361","source":"Crossref","is-referenced-by-count":12,"title":["A Study on the Hierarchical Data Clustering Algorithm Based on Gravity Theory"],"prefix":"10.1007","author":[{"given":"Yen-Jen","family":"Oyang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chien-Yu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsui-Wei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,28]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0167-8655(90)90108-E","volume":"11","author":"S. Choudry","year":"1990","unstructured":"Choudry, S. and N. Murty, A divisive scheme for constructing minimal spanning trees in coordinate space, Pattern Recognition Letters, volume 11 (1990), number 6, pp. 385\u2013389","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/351827.351829","volume":"5","author":"D. Eppstein","year":"2000","unstructured":"D. Eppstein, Fast hierarchical clustering and other applications of dynamic closest pairs, The ACM Journal of Experimental Algorithmics, 5(1):1\u201323, Jun 2000","journal-title":"The ACM Journal of Experimental Algorithmics"},{"key":"29_CR3","unstructured":"M. Ester, H.-P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, Proceedings of 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), Aug. 1996."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"B. Everitt, Cluster analysis, Halsted Press, 1980.","DOI":"10.1007\/BF00154794"},{"key":"29_CR5","unstructured":"S. Guha, R. Rastogi, and K. Shim. Cure: An efficient clustering algorithm for large databases. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data(SIGMOD\u201998), pages 73\u201384, Seattle, WA, June 1998."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"S. Guha, R. Rastogi, and S. Kyuseok. ROCK: A robust clustering algorithm for categorical attributes. In Proceedings of ICDE\u201999, pp. 512\u2013521, 1999.","DOI":"10.1109\/ICDE.1999.754967"},{"key":"29_CR7","unstructured":"J. Han, M. Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, 2000"},{"key":"29_CR8","unstructured":"A. Hinneburg, and D. A. Keim, An Efficient Approach to Clustering in Large Multimedia Databases with Noise, Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, (KDD98), pp. 58\u201365, 1998."},{"key":"29_CR9","unstructured":"A.K. Jain, R.C. Dubes, Algorithms for clustering data, Prentice Hall, 1988."},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"A.K. Jain, M.N. Murty, P.J. Flynn, Data Clustering: A Review, ACM Computing Surveys, Vol. 31, No. 3, pp.264\u2013323, Sep. 1999.","journal-title":"ACM Computing Surveys"},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"G. Karypis, E.-H. Han, and V. Kumar. CHAMELEON: A hierarchical clustering algorithm using dynamic modeling. COMPUTER, 32:68\u201375, 1999","journal-title":"COMPUTER"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/PL00009332","volume":"19","author":"D. Krznaric","year":"1998","unstructured":"D. Krznaric and C. Levcopoulos, Fast Algorithms for Complete Linkage Clustering, Discrete & Computational Geometry, 19:131\u2013145, 1998.","journal-title":"Discrete & Computational Geometry"},{"key":"29_CR13","unstructured":"Kurita, T., An efficient agglomerative clustering algorithm using a heap, Pattern Recognition, volume 24 (1991), number 3 pp. 205\u2013209"},{"key":"29_CR14","unstructured":"R.T. Ng, J. Han, Efficient and Effective Clustering Methods for Spatial Data Mining, VLDB\u201994, Proceedings of 20th International Conference on Very Large Data Bases, pp.144\u2013155, Sep. 1994."},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"M. Stonebraker, J. Frew, K. Gardels and J. Meredith, The Sequoia 2000 Storage Benchmark, Proceedings of SIGMOD, pp. 2\u201311, 1993.","DOI":"10.1145\/170036.170038"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0031-3203(77)90013-9","volume":"9","author":"W.E. Wright","year":"1977","unstructured":"W.E. Wright, Gravitational Clustering, Pattern Recognition, 1977, Vol.9, pp. 151\u2013166.","journal-title":"Pattern Recognition"},{"key":"29_CR17","unstructured":"X. Xu, M. Ester, H.-P. Kriegel, J. Sander, A distribution-based clustering algorithm for mining in large spatial databases, In Proceedings of 14th International Conference on Data Engineering (ICDE\u201998), 1998."},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Zamir, O. and O. Etzioni (1998). Web document clustering: A feasibility demonstration. In Proceedings of the 21th International ACM SIGIR Conference, pp. 46\u201354.","DOI":"10.1145\/290941.290956"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"T. Zhang, R. Ramakrishnan, M. Livny, BIRCH: An Efficient Data Clustering Method for Very Large Databases, Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp.103\u2013114, Jun. 1996.","DOI":"10.1145\/233269.233324"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44794-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:39:54Z","timestamp":1556681994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44794-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425342","9783540447948"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44794-6_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}