{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T15:55:39Z","timestamp":1783785339350,"version":"3.55.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1021394316112","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T01:22:32Z","timestamp":1048209752000},"page":"91-111","source":"Crossref","is-referenced-by-count":148,"title":["A Decision Criterion for the Optimal Number of Clusters in Hierarchical Clustering"],"prefix":"10.1007","volume":"25","author":[{"given":"Yunjae","family":"Jung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haesun","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barry L.","family":"Drake","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5090617_CR1","volume-title":"Pattern Recognition & Image Analysis","author":"E. Gose","year":"1996","unstructured":"Gose, E., Johnsonbaugh, R. and Jost, S. (1996), Pattern Recognition & Image Analysis, Prentice Hall, Upper Saddle River, NJ."},{"key":"5090617_CR2","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N. and Flynn, P.J. (1999), Data clustering: a review, ACM Computing Surveys 31, 264\u2013323.","journal-title":"ACM Computing Surveys"},{"key":"5090617_CR3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0031-3203(79)90030-X","volume":"11","author":"E. Shaffer","year":"1979","unstructured":"Shaffer, E., Dubes, R. and Jain, A.K. (1979), Single-link characteristics of a mode-seeking algorithm, Pattern Recognition 11, 65\u201373.","journal-title":"Pattern Recognition"},{"key":"5090617_CR4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0031-3203(76)90026-1","volume":"8","author":"J. Kittler","year":"1976","unstructured":"Kittler, J. (1976), A locally sensitive method for cluster analysis, Pattern Recognition 8, 22\u201333.","journal-title":"Pattern Recognition"},{"key":"5090617_CR5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"20","author":"C.T. Zahn","year":"1971","unstructured":"Zahn, C.T. (1971), Graph-theoretical methods for detecting and describing gestalt clusters, IEEE Transactions on Computers 20, 68\u201386.","journal-title":"IEEE Transactions on Computers"},{"key":"5090617_CR6","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0031-3203(82)90069-3","volume":"15","author":"R. Urquhart","year":"1982","unstructured":"Urquhart, R. (1982), Graph theoretical clustering based on limited neighborhood sets, Pattern Recognition 15, 173\u2013187.","journal-title":"Pattern Recognition"},{"key":"5090617_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0031-3203(78)90018-3","volume":"10","author":"K.C. Gowdar","year":"1978","unstructured":"Gowdar, K.C. and Krishna, G. (1978), Agglomerative clustering using the concept for multispectral data, Pattern Recognition 10, 105\u2013112.","journal-title":"Pattern Recognition"},{"key":"5090617_CR8","volume-title":"Cluster Analysis for Applications","author":"M.R. Anderberg","year":"1973","unstructured":"Anderberg, M.R. (1973), Cluster Analysis for Applications, Academic Press, New York."},{"key":"5090617_CR9","volume-title":"Handbook of Mathematical Functions with Formulas, Graphics and Mathematical Tables","author":"M. Abramowtiz","year":"1968","unstructured":"Abramowtiz, M. and Stegun, I.A. (1968), Handbook of Mathematical Functions with Formulas, Graphics and Mathematical Tables, US Govt. Printing Office, Washington, D.C."},{"key":"5090617_CR10","first-page":"493","volume-title":"Multivariate Analysis","author":"J.J. Fortier","year":"1966","unstructured":"Fortier, J.J. and Solomon, H. (1966), Clustering Procedures, In Krishnaiah, P.R. (ed). Multivariate Analysis, Academic Press, New York. pp. 493\u2013506."},{"key":"5090617_CR11","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1287\/opre.17.6.1034","volume":"17","author":"R.E. Jensen","year":"1967","unstructured":"Jensen, R.E. (1967), A dynamic programming algorithm for cluster analysis, Operations Research 17, 1034\u20131057.","journal-title":"Operations Research"},{"key":"5090617_CR12","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K. and Dubes, R.C. (1988), Algorithms for Clustering Data, Prentice Hall, Englewood Cliffs, NJ."},{"key":"5090617_CR13","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0306-4573(88)90027-1","volume":"24","author":"P. Willet","year":"1988","unstructured":"Willet, P., (1988), Recent trends in hierarchic document clustering: a critical review, Information Processing and Management 24, 577\u2013597.","journal-title":"Information Processing and Management"},{"key":"5090617_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1071\/BT9660127","volume":"14","author":"R.C. Jancey","year":"1966","unstructured":"Jancey, R.C., (1966), Multidimensional group analysis, Austral. J. Botany 14, 127\u2013130.","journal-title":"Austral. J. Botany"},{"key":"5090617_CR15","first-page":"281","volume-title":"the Fifth Berkeley Symposium on Mathematical Statistics and Probability","author":"J.B. MacQueen","year":"1967","unstructured":"MacQueen, J.B. (1967), Some methods for classification and analysis of multivariate observations. In: the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol.1, AD 669871, University of California Press, Berkeley, CA, pp. 281\u2013297."},{"key":"5090617_CR16","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R. Sibson","year":"1973","unstructured":"Sibson, R. (1973), SLINK: an optimally efficient algorithm for the single-link cluster method, Computer Journal 16, 30\u201334.","journal-title":"Computer Journal"},{"key":"5090617_CR17","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1093\/comjnl\/20.4.364","volume":"20","author":"D. Defays","year":"1977","unstructured":"Defays, D. (1977), An efficient algorithm for a complete link method, Computer Journal 20, 364\u2013366.","journal-title":"Computer Journal"},{"key":"5090617_CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01890115","volume":"1","author":"W.H.E. Day","year":"1984","unstructured":"Day, W.H.E. and Edelsbrunner, H. (1984), Efficient algorithms for agglomerative hierarchical clustering methods, Journal of Classification 1, 7\u201324.","journal-title":"Journal of Classification"},{"key":"5090617_CR19","unstructured":"Ng, R.T. and Han G., J. (1994), Efficient and effective clustering methods for spatial data mining. In: Proceedings of the 20th VLDB Conference, Santiago, Chile."},{"key":"5090617_CR20","first-page":"465","volume-title":"Information Processing and Management","author":"E.M. Voorhees","year":"1986","unstructured":"Voorhees, E.M. (1986), Implementing agglomerative hierarchical clustering algorithms for use in document retrieval. In: Information Processing and Management Vol. 22, Pergamon, Oxford, pp. 465\u2013476."},{"key":"5090617_CR21","doi-asserted-by":"crossref","unstructured":"Li, X. (1990), Parallel algorithms for hierarchical clustering and cluster validity, IEEE Transactions on Pattern Analysis and Machine Intelligence, 1088\u20131092.","DOI":"10.1109\/34.61708"},{"key":"5090617_CR22","unstructured":"Bradley, P., Fayyad, U. and Reina, C. (1998) Scaling clusterin algorithms to large databases, Knowledge Discovery and Data Mining."},{"key":"5090617_CR23","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R. and Shim, K. (1998), CURE: an efficient clustering algorithm for large databases. In: ACM-SIGMOD Int. Conf. on Management of Data, Seattle, WA. 73\u201384.","DOI":"10.1145\/276304.276312"},{"key":"5090617_CR24","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R. and Shim, K. (1999), ROCK: a robust clustering algorithm for categorical attributes. In: the 15th Int. Conf. on Data Eng.","DOI":"10.1109\/ICDE.1999.754967"},{"key":"5090617_CR25","unstructured":"Ganti, V., Ramakrishnan, R. and Gehrke, J. (2000), Clustering large datasets in arbitrary metric spaces. ACM."},{"key":"5090617_CR26","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Feder, T. and Motwani, R. (1997), Incremental clustering and dynamic information retrieval. In: STOC '97, El Paso, TX, pp. 153\u2013180.","DOI":"10.1145\/258533.258657"},{"key":"5090617_CR27","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/0031-3203(87)90034-3","volume":"20","author":"R.C. Dubes","year":"1987","unstructured":"Dubes, R.C. (1987), How many Clusters are best? \u2013 an experiment, Pattern Recognition 20, 645\u2013663.","journal-title":"Pattern Recognition"},{"key":"5090617_CR28","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF02294245","volume":"50","author":"G.W. Milligan","year":"1985","unstructured":"Milligan, G.W. and Cooper M.C. (1985), An examination of procedures for detecting the number of clusters in a data set, Psychometrika 50, 159\u2013179.","journal-title":"Psychometrika"},{"key":"5090617_CR29","volume-title":"Pattern Recognition Principles","author":"J.T. Tou","year":"1974","unstructured":"Tou, J.T. and Gonzalez, R.C. (1974) Pattern Recognition Principles, Addison-Wesley, Miami, FL."},{"key":"5090617_CR30","volume-title":"Cluster analysis","author":"B. Everett","year":"1975","unstructured":"Everett, B. (1975), Cluster analysis, Addison-Wesley, New York."},{"key":"5090617_CR31","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/A:1009740529316","volume":"2","author":"D.L. Boley","year":"1998","unstructured":"Boley, D.L. (1998), Principal direction divisive partitioning, Data mining and knowledge discovery 2, 325\u2013344.","journal-title":"Data mining and knowledge discovery"},{"key":"5090617_CR32","first-page":"261","volume-title":"Handbook of Combinatorial Optimization","author":"B. Mirkin","year":"1998","unstructured":"Mirkin, B. and Muchnik, I. (1998), Combinatorial Optimization in Clustering. In: Du, D.Z. and Pardalos, P.M. (eds), Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Dordrecht pp. 261\u2013329."},{"key":"5090617_CR33","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Han E.S. and Kumar, V. (1999), CHAMELEON: a hierarchical clustering algorithm using dynamic modeling, IEEE Computer: Special Issue on Data Analysis and Mining 32, 68\u201375.","journal-title":"IEEE Computer: Special Issue on Data Analysis and Mining"},{"key":"5090617_CR34","volume-title":"Cluster Analysis: A Survey","author":"B.S. Duran","year":"1977","unstructured":"Duran, B.S. and Odell, P.L. (1977) Cluster Analysis: A Survey, Springer, Berlin."},{"key":"5090617_CR35","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-642-96303-2_3","volume-title":"Digital Pattern Recognition","author":"E. Diday","year":"1976","unstructured":"Diday, E. and Simon, J.C. (1976), Clustering Analysis. In: Fu, K.S. (ed), Digital Pattern Recognition, Springer, Secaucus, NJ, pp. 47\u201394."},{"key":"5090617_CR36","volume-title":"Computers and Intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S. (1979), Computers and Intractability: a guide to the theory of NP-completeness, W.H.Freeman and Company, San Francisco, CA."},{"key":"5090617_CR37","unstructured":"Crescenzi, P. and Kann, V. (1995), A compendium of NP optimization problems, URL site:http:\/\/www.nada.kth.se\/\n$${{\\tilde v}}$$\niggo\/problemlist\/compendium2."},{"key":"5090617_CR38","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"J.H. Ward Jr.","year":"1963","unstructured":"Ward, Jr. J.H. (1963), Hierarchical grouping to optimize an objective function, Journal of the American Statical Association 58, 236\u2013244.","journal-title":"Journal of the American Statical Association"},{"key":"5090617_CR39","first-page":"768","volume":"21","author":"E.W. Forgy","year":"1965","unstructured":"Forgy, E.W. (1965), Cluster analysis of multivariate data: efficiency versus interpretability of classification. In: Biometric Society Meetings, Reverside, CA, Abstract in Biometrics 21, 768.","journal-title":"Biometric Society Meetings, Reverside, CA"},{"key":"5090617_CR40","doi-asserted-by":"crossref","unstructured":"Sebestyen, G.S. (1962), Pattern recognition by an adaptive process of sample set construction. IRE Trans. on Info. Theory IT\u20138.","DOI":"10.1109\/TIT.1962.1057766"},{"key":"5090617_CR41","unstructured":"MacQueen, J.B. (1966), Some methods for classification and analysis of multivariate observations. In: Wester Management Science Inst., University of California, pp. 96, 1966"},{"key":"5090617_CR42","unstructured":"Ball, G.H. and Hall, D.J. (1964), Some fundamental concepts and synthesis procedures for pattern recognition preprocessors. In: International Conference on Microwaves, Circuit Theory, and Information Theory."},{"key":"5090617_CR43","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: an Introduction to Clustering Analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L. and Rousseeuw, P.J. (1990) Finding Groups in Data: an Introduction to Clustering Analysis, Academic Press, San Diego, CA."},{"key":"5090617_CR44","first-page":"419","volume-title":"Information Retrieval: Data Structures and Algorithms","author":"E. Rasmussen","year":"1992","unstructured":"Rasmussen, E. (1992), Clustering Algorithms. In: Frakes, W.B. and Baeza-Yates, R. (eds), Information Retrieval: Data Structures and Algorithms, Prentice-Hall, Upper Saddle River, NJ, pp. 419\u2013442."},{"key":"5090617_CR45","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0271(71)90051-9","volume":"7","author":"N. Jardine","year":"1971","unstructured":"Jardine, N. and Rijsbergen, C.J. (1971), The use of hierarchical clustering in information retrieval. Information Storage and Retrieval 7, 217\u2013240.","journal-title":"Information Storage and Retrieval"},{"key":"5090617_CR46","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1109\/TIT.1969.1054365","volume":"15","author":"R.S. Bennett","year":"1966","unstructured":"Bennett, R.S. (1966), The intrinsic dimensionality of signal collections, IEEE Transactions on Information Theory 15, 517\u2013525.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5090617_CR47","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T. Zhang","year":"1996","unstructured":"Zhang, T., Ramakrishnan, R. and Livny, M. (1996), BIRCH: An efficient data clustering method for very large databases, SIGMOD Rec. 25, 103\u2013114.","journal-title":"SIGMOD Rec."},{"key":"5090617_CR48","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"M.F. Porter","year":"1980","unstructured":"Porter, M.F. (1980), An Algorithm for Suffix Stripping, Program, 14, 130\u2013137.","journal-title":"Program"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021394316112.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021394316112\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021394316112.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:44:14Z","timestamp":1751366654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021394316112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5090617"],"URL":"https:\/\/doi.org\/10.1023\/a:1021394316112","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}