{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T16:17:35Z","timestamp":1779293855584,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T00:00:00Z","timestamp":1720137600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T00:00:00Z","timestamp":1720137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10489-024-05636-2","type":"journal-article","created":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T11:01:58Z","timestamp":1720177318000},"page":"8876-8888","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Global k-means++: an effective relaxation of the global k-means clustering algorithm"],"prefix":"10.1007","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1352-2062","authenticated-orcid":false,"given":"Georgios","family":"Vardakas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3170-5428","authenticated-orcid":false,"given":"Aristidis","family":"Likas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,5]]},"reference":[{"issue":"3","key":"5636_CR1","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain AK, Murty MN, Flynn PJ (1999) Data clustering: a review. ACM Comput Surv (CSUR) 31(3):264\u2013323","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"1","key":"5636_CR2","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.patcog.2007.05.018","volume":"41","author":"M Filippone","year":"2008","unstructured":"Filippone M, Camastra F, Masulli F, Rovetta S (2008) A survey of kernel and spectral methods for clustering. Pattern Recognit 41(1):176\u2013190","journal-title":"Pattern Recognit"},{"issue":"8","key":"5636_CR3","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50 years beyond k-means. Pattern Recognit Lett 31(8):651\u2013666","journal-title":"Pattern Recognit Lett"},{"key":"5636_CR4","unstructured":"Kaufman L, Rousseeuw PJ (2009) Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley & Sons"},{"key":"5636_CR5","doi-asserted-by":"crossref","unstructured":"Cohen-Addad V, Karthik C (2019) Inapproximability of clustering in lp metrics. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, pp 519\u2013539","DOI":"10.1109\/FOCS.2019.00040"},{"key":"5636_CR6","doi-asserted-by":"crossref","unstructured":"Cohen-Addad V, Karthik C, Lee E (2021) On approximability of clustering problems without candidate centers. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, pp 2635\u20132648","DOI":"10.1137\/1.9781611976465.156"},{"issue":"2","key":"5636_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise D, Deshpande A, Hansen P, Popat P (2009) Np-hardness of euclidean sum-of-squares clustering. Mach Learn 75(2):245\u2013248","journal-title":"Mach Learn"},{"key":"5636_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2010.05.034","volume":"442","author":"M Mahajan","year":"2012","unstructured":"Mahajan M, Nimbhorkar P, Varadarajan K (2012) The planar k-means problem is np-hard. Theoretical Comput Sci 442:13\u201321","journal-title":"Theoretical Comput Sci"},{"key":"5636_CR9","first-page":"281","volume":"1","author":"J MacQueen","year":"1967","unstructured":"MacQueen J et al (1967) Some methods for classification and analysis of multivariate observations. Proceedings of the fifth berkeley symposium on mathematical statistics and probability, Oakland, CA, USA 1:281\u2013297","journal-title":"Proceedings of the fifth berkeley symposium on mathematical statistics and probability, Oakland, CA, USA"},{"issue":"2","key":"5636_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd S (1982) Least squares quantization in pcm. IEEE Trans Inf Theory 28(2):129\u2013137","journal-title":"IEEE Trans Inf Theory"},{"issue":"1","key":"5636_CR11","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","volume":"40","author":"ME Celebi","year":"2013","unstructured":"Celebi ME, Kingravi HA, Vela PA (2013) A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst Appl 40(1):200\u2013210","journal-title":"Expert Syst Appl"},{"key":"5636_CR12","unstructured":"Arthur D, Vassilvitskii S (2006) k-means++: The advantages of careful seeding. Technical Report 2006-13, Stanford InfoLab. http:\/\/ilpubs.stanford.edu:8090\/778\/"},{"issue":"2","key":"5636_CR13","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A Likas","year":"2003","unstructured":"Likas A, Vlassis N, Verbeek JJ (2003) The global k-means clustering algorithm. Pattern Recognit 36(2):451\u2013461","journal-title":"Pattern Recognit"},{"key":"5636_CR14","doi-asserted-by":"crossref","unstructured":"Agrawal A, Gupta H (2013) Global k-means (gkm) clustering algorithm: a survey. Int J Comput Appl 79(2)","DOI":"10.5120\/13713-1472"},{"key":"5636_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.patcog.2019.04.014","volume":"93","author":"P Fr\u00e4nti","year":"2019","unstructured":"Fr\u00e4nti P, Sieranoja S (2019) How much can k-means be improved by using better initialization and repeats? Pattern Recognit 93:95\u2013112","journal-title":"Pattern Recognit"},{"key":"5636_CR16","doi-asserted-by":"publisher","unstructured":"Ajmera J, Wooters C (2003) A robust speaker clustering algorithm. In: 2003 IEEE Workshop on automatic speech recognition and understanding (IEEE Cat. No.03EX721), pp 411\u2013416. https:\/\/doi.org\/10.1109\/ASRU.2003.1318476","DOI":"10.1109\/ASRU.2003.1318476"},{"issue":"7","key":"5636_CR17","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1038\/nri.2016.56","volume":"16","author":"Y Saeys","year":"2016","unstructured":"Saeys Y, Van Gassen S, Lambrecht BN (2016) Computational flow cytometry: helping to make sense of high-dimensional immunology data. Nature Rev Immunol 16(7):449\u2013462","journal-title":"Nature Rev Immunol"},{"key":"5636_CR18","unstructured":"Wei Z, Chen Y-C Skeleton clustering: Graph-based approach for dimension-free density-aided clustering. In: NeurIPS 2022 Workshop: New Frontiers in Graph Learning"},{"key":"5636_CR19","doi-asserted-by":"crossref","unstructured":"Nie F, Wang C-L, Li X (2019) K-multiple-means: A multiple-means clustering method with specified k clusters. In: Proceedings of the 25th ACM SIGKDD International conference on knowledge discovery & data mining, pp 959\u2013967","DOI":"10.1145\/3292500.3330846"},{"issue":"2","key":"5636_CR20","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4304\/jcp.6.2.271-279","volume":"6","author":"J Xie","year":"2011","unstructured":"Xie J, Jiang S, Xie W, Gao X (2011) An efficient global k-means clustering algorithm. J Comput 6(2):271\u2013279","journal-title":"J Comput"},{"issue":"4","key":"5636_CR21","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.patcog.2010.10.018","volume":"44","author":"AM Bagirov","year":"2011","unstructured":"Bagirov AM, Ugon J, Webb D (2011) Fast modified global k-means algorithm for incremental cluster construction. Pattern Recognit 44(4):866\u2013876","journal-title":"Pattern Recognit"},{"key":"5636_CR22","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ins.2013.05.023","volume":"245","author":"L Bai","year":"2013","unstructured":"Bai L, Liang J, Sui C, Dang C (2013) Fast global k-means clustering based on local geometrical information. Inf Sci 245:168\u2013180","journal-title":"Inf Sci"},{"key":"5636_CR23","doi-asserted-by":"crossref","unstructured":"Lai JZ, Huang T- (2010) Fast global k-means clustering using cluster membership and inequality. Pattern Recognit 43(5):1954\u20131963","DOI":"10.1016\/j.patcog.2009.11.021"},{"issue":"9","key":"5636_CR24","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1109\/TPAMI.2002.1033218","volume":"24","author":"CJ Veenman","year":"2002","unstructured":"Veenman CJ, Reinders MJT, Backer E (2002) A maximum variance cluster algorithm. IEEE Trans Pattern Anal Mach Intell 24(9):1273\u20131280","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"5636_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw PJ (1987) Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math 20:53\u201365","journal-title":"J Comput Appl Math"},{"issue":"1","key":"5636_CR26","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.patcog.2012.07.021","volume":"46","author":"O Arbelaitz","year":"2013","unstructured":"Arbelaitz O, Gurrutxaga I, Muguerza J, P\u00e9rez JM, Perona I (2013) An extensive comparative study of cluster validity indices. Pattern Recognit 46(1):243\u2013256","journal-title":"Pattern Recognit"},{"issue":"7","key":"5636_CR27","doi-asserted-by":"publisher","first-page":"622","DOI":"10.14778\/2180912.2180915","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani B, Moseley B, Vattani A, Kumar R, Vassilvitskii S (2012) Scalable k-means++. Proceedings of the VLDB Endowment 5(7):622\u2013633","journal-title":"Proceedings of the VLDB Endowment"},{"key":"5636_CR28","unstructured":"Dua D, Graff C (2017) UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"5636_CR29","unstructured":"LeCun Y, Cortes C (2010) MNIST handwritten digit database"},{"issue":"2","key":"5636_CR30","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01897163","volume":"5","author":"GW Milligan","year":"1988","unstructured":"Milligan GW, Cooper MC (1988) A study of standardization of variables in cluster analysis. J Classification 5(2):181\u2013204","journal-title":"J Classification"},{"key":"5636_CR31","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ins.2022.11.139","volume":"622","author":"AM Ikotun","year":"2023","unstructured":"Ikotun AM, Ezugwu AE, Abualigah L, Abuhaija B, Heming J (2023) K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data. Inf Sci 622:178\u2013210","journal-title":"Inf Sci"},{"key":"5636_CR32","unstructured":"Bachem O, Lucic M, Hassani H, Krause A (2016) Fast and provably good seedings for k-means. Advances in neural information processing systems 29"},{"key":"5636_CR33","unstructured":"Choo D, Grunau C, Portmann J, Rozhon V (2020) k-means++: few more steps yield constant approximation. In: International conference on machine learning, PMLR pp 1909\u20131917"},{"key":"5636_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105958","volume":"147","author":"V Piccialli","year":"2022","unstructured":"Piccialli V, Russo AR, Sudoso AM (2022) An exact algorithm for semi-supervised minimum sum-of-squares clustering. Comput & Operations Res 147:105958","journal-title":"Comput & Operations Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05636-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-024-05636-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-024-05636-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T13:05:15Z","timestamp":1723727115000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-024-05636-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,5]]},"references-count":34,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["5636"],"URL":"https:\/\/doi.org\/10.1007\/s10489-024-05636-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,5]]},"assertion":[{"value":"20 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interests"}},{"value":"This article does not contain any studies conducted on human or animal subjects by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}]}}