{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T22:44:57Z","timestamp":1762641897939,"version":"3.41.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2016,10,13]],"date-time":"2016-10-13T00:00:00Z","timestamp":1476316800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00500-016-2369-6","type":"journal-article","created":{"date-parts":[[2016,10,13]],"date-time":"2016-10-13T01:38:36Z","timestamp":1476322716000},"page":"6571-6592","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Pseudo-centroid clustering"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6945-0438","authenticated-orcid":false,"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,13]]},"reference":[{"key":"2369_CR1","volume-title":"Cluster analysis for applications","author":"MR Anderberg","year":"1973","unstructured":"Anderberg MR (1973) Cluster analysis for applications. Academic Press, London"},{"key":"2369_CR2","doi-asserted-by":"crossref","unstructured":"Anwar TM, Beck HW, Navathe SB (2012) Knowledge mining by imprecise querying: a classification-based approach. In: Proceedings of the eighth international conference on data engineering, IEEE computer society, pp 622\u2013630. Washington, DC","DOI":"10.1109\/ICDE.1992.213146"},{"issue":"4","key":"2369_CR3","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s11518-010-5150-x","volume":"19","author":"B Cao","year":"2010","unstructured":"Cao B, Glover F (2010) Creating balanced and connected clusters to improve service delivery routes in logistics planning. J Syst Sci Syst Eng 19(4):453\u2013480","journal-title":"J Syst Sci Syst Eng"},{"key":"2369_CR4","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10732-015-9285-2","volume":"21","author":"B Cao","year":"2015","unstructured":"Cao B, Glover F, Rego C (2015) A tabu search algorithm for cohesive clustering problems. J Heuristics 21:457\u2013477","journal-title":"J Heuristics"},{"key":"2369_CR5","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","volume":"1","author":"DL Davies","year":"1979","unstructured":"Davies DL, Bouldin DW (1979) A cluster separation measure. IEEE Trans Pattern Anal Mach Intell 1:224\u2013227","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2369_CR6","doi-asserted-by":"crossref","unstructured":"Estivill-Castro V, Lee I (2001) Fast spatial clustering with different metrics and in the presence of obstacles. GIS\u201901 142\u2013147","DOI":"10.1145\/512161.512193"},{"key":"2369_CR7","doi-asserted-by":"crossref","first-page":"3923","DOI":"10.1016\/j.eswa.2008.02.056","volume":"36","author":"B Fan","year":"2009","unstructured":"Fan B (2009) A hybrid spatial data clustering method for site selection: the data driven approach of GIS mining. Exp Syst Appl 36:3923\u20133936","journal-title":"Exp Syst Appl"},{"key":"2369_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(94)90211-9","volume":"49","author":"F Glover","year":"1994","unstructured":"Glover F (1994) Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Appl Math 49:231\u2013255","journal-title":"Discrete Appl Math"},{"key":"2369_CR9","unstructured":"Glover F (1997) A template for scatter search and path relinking. In: J-K Hao, E Lutton, E Ronald, M Schoenauer, D Snyers (eds) Artificial evolution, lecture notes in computer science. 1363, pp 13\u201354. Springer, Berlin"},{"key":"2369_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Z Huang","year":"1998","unstructured":"Huang Z (1998) Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Min Knowl Discov 2:283\u2013304","journal-title":"Data Min Knowl Discov"},{"key":"2369_CR11","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice-Hall, Englewood Cliffs, NJ"},{"key":"2369_CR12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20:359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"2369_CR13","doi-asserted-by":"crossref","unstructured":"Kauffmann L, Rousseeuw PJ (1990) Finding groups in data\u2014an introduction to cluster analysis. Wiley, London","DOI":"10.1002\/9780470316801"},{"key":"2369_CR14","doi-asserted-by":"crossref","unstructured":"Kochenberger G, Glover F, Alidaee B, Wang H (2005) Clustering of microarray data via clique partitioning. J Comb Optim 10:77\u201392","DOI":"10.1007\/s10878-005-1861-1"},{"key":"2369_CR15","doi-asserted-by":"crossref","unstructured":"Kwon Y-J, Kim JG, Seo J, Lee DH, Kim DS (2007) A tabu search algorithm using voronoi diagram for the capacitated vehicle routing problem. In: Proceeding of 5th international conference on computational science and applications. IEEE computer society, pp 480\u2013485","DOI":"10.1109\/ICCSA.2007.11"},{"key":"2369_CR16","first-page":"281","volume-title":"Proceedings of 5th Berkeley symposium on mathematical statistics and probability","author":"JB MacQueen","year":"1967","unstructured":"MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. Proceedings of 5th Berkeley symposium on mathematical statistics and probability. University of California Press, Berkeley, pp 281\u2013297"},{"issue":"5","key":"2369_CR17","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","volume":"14","author":"R Ng","year":"2002","unstructured":"Ng R, Han J (2002) CLARANS: a method for custering objects for satial data mining. IEEE Trans Knowl Data Eng 14(5):1003\u20131016","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"7","key":"2369_CR18","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/j.patrec.2004.09.039","volume":"26","author":"N Paivinen","year":"2005","unstructured":"Paivinen N (2005) Clustering with a minimum spanning tree of scale-free-like structure. Pattern Recognit Lett 26(7):921\u2013930","journal-title":"Pattern Recognit Lett"},{"key":"2369_CR19","doi-asserted-by":"crossref","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","volume":"36","author":"H-S Park","year":"2009","unstructured":"Park H-S, Jun C-H (2009) A simple and fast algorithm for K-medoids clustering. Expert Syst Appl 36:3336\u20133341","journal-title":"Expert Syst Appl"},{"key":"2369_CR20","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1016\/0167-8655(95)00075-R","volume":"16","author":"H Ralambondrainy","year":"1995","unstructured":"Ralambondrainy H (1995) A conceptual version of the k-means algorithm. Pattern Recognit Lett 16:1147\u20131157","journal-title":"Pattern Recognit Lett"},{"key":"2369_CR21","unstructured":"Shamsul A, Inostroza-Ponta M, Mathieson L, Berretta R, Moscato P (2011) Clustering nodes in large-scale biological networks using external memory algorithms. In: Xiang et\u00a0al (ed) ICA3PP 2011 workshops, part II, LNCS 7017, pp 375\u2013386"},{"key":"2369_CR22","unstructured":"Strehl A, Ghosh J (2002) Relationship-based clustering and visualization for high-dimensional data mining. INFORMS J Comput 1\u201323"},{"key":"2369_CR23","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.ijepes.2011.12.005","volume":"37","author":"KR Sudha","year":"2012","unstructured":"Sudha KR, Raju YB, Sekhar AC (2012) Fuzzy C-means clustering for robust decentralized load frequency control of interconnected power system with generation rate constraint. Electr Power Energy Syst 37:58\u201366","journal-title":"Electr Power Energy Syst"},{"key":"2369_CR24","first-page":"24","volume":"12","author":"Y Xu","year":"2001","unstructured":"Xu Y, Olman V, Xu D (2001) Minimum spanning trees for gene expression data clustering. Genome Inf 12:24\u201333","journal-title":"Genome Inf"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2369-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2369-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2369-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T09:33:23Z","timestamp":1749634403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2369-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,13]]},"references-count":24,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2369"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2369-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2016,10,13]]}}}