{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T20:38:41Z","timestamp":1774384721697,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00521-025-11822-1","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T02:40:34Z","timestamp":1772505634000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improve cluster quality with better centroid selection"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8476-163X","authenticated-orcid":false,"given":"J. Emilio","family":"Quiroz-Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4239-7144","authenticated-orcid":false,"given":"Jorge \u00c1ngel","family":"Gonz\u00e1lez-Ordiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,3]]},"reference":[{"key":"11822_CR1","doi-asserted-by":"publisher","unstructured":"Kotu V, Deshpande B (2019) Chapter 7\u2013Clustering. In: Kotu V, Deshpande B (Eds) Data science (Second Edition). Morgan Kaufmann, pp 221\u2013261. https:\/\/doi.org\/10.1016\/B978-0-12-814761-0.00007-1","DOI":"10.1016\/B978-0-12-814761-0.00007-1"},{"key":"11822_CR2","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/OJCAS.2024.3381508","volume":"5","author":"L Ge","year":"2024","unstructured":"Ge L, Parhi KK (2024) Robust clustering using hyperdimensional computing. IEEE Open J Circuits Syst 5:102\u2013116. https:\/\/doi.org\/10.1109\/OJCAS.2024.3381508","journal-title":"IEEE Open J Circuits Syst"},{"issue":"2","key":"11822_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s12559-009-9009-8","volume":"1","author":"P Kanerva","year":"2009","unstructured":"Kanerva P (2009) Hyperdimensional computing: an introduction to computing in distributed representation with high-dimensional random vectors. Cogn Comput 1(2):139\u2013159. https:\/\/doi.org\/10.1007\/s12559-009-9009-8","journal-title":"Cogn Comput"},{"key":"11822_CR4","unstructured":"Dancker J (2025) A brief introduction to distance measures. Medium. Accessed 05 Jan 2025. [Online]. https:\/\/medium.com\/@jodancker\/a-brief-introduction-to-distance-measures-ac89cbd2298"},{"key":"11822_CR5","doi-asserted-by":"publisher","first-page":"119596","DOI":"10.1109\/ACCESS.2023.3327640","volume":"11","author":"SMM Seyed Mahdi Miraftabzadeh","year":"2023","unstructured":"Seyed Mahdi Miraftabzadeh SMM, Cristian Giovanni Colombo CGC, Michela Longo ML, Federica Foiadelli FF (2023) K-means and alternative clustering methods in modern power systems. IEEE Access 11:119596\u2013119633. https:\/\/doi.org\/10.1109\/ACCESS.2023.3327640","journal-title":"IEEE Access"},{"key":"11822_CR6","unstructured":"Scopus - Advanced search. Accessed 11 Jun 2025. [Online]. Available: https:\/\/www.scopus.com\/search\/form.uri?display=advanced"},{"key":"11822_CR7","unstructured":"Abril XC \u201cAproximaci\u00f3n al reajuste autom\u00e1tico de centroides mediante la heur\u00edstica de Lloyd para resolver el problema de las K-Medias\u201d, [Online]. Available: https:\/\/openaccess.uoc.edu\/server\/api\/core\/bitstreams\/43d20342-cf1b-4434-850a-90753156ecbd\/content"},{"key":"11822_CR8","unstructured":"Kassambara A (2024) Cluster Validation Statistics: Must Know Methods,\u201d Datanovia. Accessed 21 Dec 2024. [Online]. Available: https:\/\/www.datanovia.com\/en\/lessons\/cluster-validation-statistics-must-know-methods\/"},{"issue":"6","key":"11822_CR9","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.3233\/IDA-163129","volume":"21","author":"J Xiao","year":"2017","unstructured":"Xiao J, Lu J, Li X (2017) Davies Bouldin Index based hierarchical initialization K-means. IDA 21(6):1327\u20131338. https:\/\/doi.org\/10.3233\/IDA-163129","journal-title":"IDA"},{"issue":"2","key":"11822_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3644393","volume":"5","author":"J Ghadermazi","year":"2024","unstructured":"Ghadermazi J, Shah A, Jajodia S (2024) A machine learning and optimization framework for efficient alert management in a cybersecurity operations center. Digit Threats 5(2):1\u201323. https:\/\/doi.org\/10.1145\/3644393","journal-title":"Digit Threats"},{"key":"11822_CR11","unstructured":"Verma A (2025) Centroid-based Clustering: a powerful machine learning technique for partitioning datasets. DEV Community. Accessed 03 June 2025. [Online]. Available: https:\/\/dev.to\/anurag629\/centroid-based-clustering-a-powerful-machine-learning-technique-for-partitioning-datasets-41im"},{"key":"11822_CR12","doi-asserted-by":"publisher","unstructured":"Quiroz-Ibarra JE, Flores-Godoy JJ, Gonz\u00e1lez-Ordiano J\u00c1, Vazquez GE (2024) Clustering of news texts using hyperdimensional computing. Presented at the 2024 IEEE URUCON, Montevideo, Uruguay: IEEE, pp 123\u2013128. https:\/\/doi.org\/10.1109\/URUCON63440.2024.10850161","DOI":"10.1109\/URUCON63440.2024.10850161"},{"key":"11822_CR13","unstructured":"Tiwari A (2025) The Crucial role of normalization and standardization in enhancing machine learning models. Medium. Accessed 05 Jan 2025. [Online]. Available: https:\/\/medium.com\/@aryantiwari7777\/the-crucial-role-of-normalization-and-standardization-in-enhancing-machine-learning-models-71afa24a79a"},{"issue":"2065","key":"11822_CR14","doi-asserted-by":"publisher","first-page":"20150202","DOI":"10.1098\/rsta.2015.0202","volume":"374","author":"IT Jolliffe","year":"2016","unstructured":"Jolliffe IT, Cadima J (2016) Principal component analysis: a review and recent developments. Philos Trans R Soc Lond A Math Phys Eng Sci 374(2065):20150202. https:\/\/doi.org\/10.1098\/rsta.2015.0202","journal-title":"Philos Trans R Soc Lond A Math Phys Eng Sci"},{"key":"11822_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-031-11833-3_3","volume-title":"Introduction to statistics and data analysis: with exercises, solutions and applications","author":"C Heumann","year":"2022","unstructured":"Heumann C, Schomaker M, Shalabh y (2022) Measures of central tendency and dispersion. In: Heumann RC, Schomaker M, Shalabh y (eds) Introduction to statistics and data analysis: with exercises, solutions and applications. Springer International Publishing, Cham, pp 37\u201367. https:\/\/doi.org\/10.1007\/978-3-031-11833-3_3"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11822-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-025-11822-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-025-11822-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:08:29Z","timestamp":1774372109000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-025-11822-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["11822"],"URL":"https:\/\/doi.org\/10.1007\/s00521-025-11822-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"9 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2026","order":3,"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 that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"QuillBot Paraphrasing Tool Kit\n                      assisted in rephrasing certain sections to improve linguistic expression, but the content\u2019s intellectual ownership and accuracy remain entirely with the authors, who thoroughly reviewed and approved all modifications.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"98"}}