{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:32:53Z","timestamp":1775039573226,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,5,6]],"date-time":"2014-05-06T00:00:00Z","timestamp":1399334400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s10898-014-0175-1","type":"journal-article","created":{"date-parts":[[2014,5,6]],"date-time":"2014-05-06T00:01:23Z","timestamp":1399334483000},"page":"427-443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["New heuristic for harmonic means clustering"],"prefix":"10.1007","volume":"63","author":[{"given":"Emilio","family":"Carrizosa","sequence":"first","affiliation":[]},{"given":"Abdulrahman","family":"Alguwaizani","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"key":"175_CR1","doi-asserted-by":"crossref","first-page":"2688","DOI":"10.1016\/j.apm.2010.11.032","volume":"35","author":"A Alguwaizani","year":"2011","unstructured":"Alguwaizani, A., Hansen, P., Mladenovic, N., Ngai, E.: Variable neighborhood search for harmonic means clustering. Appl. Math. Model. 35, 2688\u20132694 (2011)","journal-title":"Appl. Math. Model."},{"key":"175_CR2","doi-asserted-by":"crossref","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.: Np-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75, 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"key":"175_CR3","unstructured":"Aloise, D., Hansen, P.: Clustering. In: Sheir D.r. (ed.) Handbook of Discrete and Combinatorial Mathemaics. CRC Press (2009)"},{"key":"175_CR4","doi-asserted-by":"crossref","first-page":"8022","DOI":"10.1016\/j.eswa.2012.01.131","volume":"39","author":"L Bai","year":"2012","unstructured":"Bai, L., Liang, J., Dang, C., Cao, F.: A cluster centers initialization method for clustering categorical data. Expert Syst. Appl. 39, 8022\u20138029 (2012)","journal-title":"Expert Syst. Appl."},{"key":"175_CR5","unstructured":"Blake, C.L., Merz, C.J.: UCI repository of machine learning databases. http:\/\/archive.ics.uci.edu\/ml\/datasets.html (1998)"},{"issue":"1","key":"175_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s101070050054","volume":"85","author":"J Brimberg","year":"1999","unstructured":"Brimberg, J., Mladenovi\u0107, N.: Degeneracy in the multi-source Weber problem. Math. Program. 85(1), 213\u2013220 (1999)","journal-title":"Math. Program."},{"key":"175_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10288-009-0108-x","volume":"8","author":"J Brimberg","year":"2010","unstructured":"Brimberg, J., Hansen, P., Mladenovic, N.: Attraction probabilities in Variable neighborhood search. 4OR 8, 181\u2013194 (2010)","journal-title":"4OR"},{"key":"175_CR8","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/j.camwa.2009.04.017","volume":"58","author":"F Cao","year":"2009","unstructured":"Cao, F., Liang, J., Jiang, G.: An initialization method for the $$K$$ K - Means algorithm using neighborhood model. Comput. Math. Appl. 58, 474\u2013483 (2009)","journal-title":"Comput. Math. Appl."},{"key":"175_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2298\/YJOR1102157C","volume":"21","author":"E Carrizosa","year":"2011","unstructured":"Carrizosa, E., Mladenovic, N., Todosijevic, R.: Sum-of-squares clustering on networks. Yugosl. J. Oper. Res. 21, 157\u2013161 (2011)","journal-title":"Yugosl. J. Oper. Res."},{"key":"175_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.camwa.2010.04.032","volume":"60","author":"Y-M Chua","year":"2010","unstructured":"Chua, Y.-M., Xiab, W.-F.: Two optimal double inequalities between power mean and logarithmic mean. Comput. Math. Appl. 60, 83\u201389 (2010)","journal-title":"Comput. Math. Appl."},{"key":"175_CR11","doi-asserted-by":"crossref","first-page":"664671","DOI":"10.1016\/j.camwa.2011.12.080","volume":"64","author":"A \u010ci\u017eme\u0161ija","year":"2012","unstructured":"\u010ci\u017eme\u0161ija, A.: A new sharp double inequality for generalized Heronian, harmonic and power means. Comput. Math. Appl. 64, 664671 (2012)","journal-title":"Comput. Math. Appl."},{"key":"175_CR12","doi-asserted-by":"crossref","first-page":"1701","DOI":"10.1016\/j.patrec.2011.07.011","volume":"32","author":"M Erisoglu","year":"2011","unstructured":"Erisoglu, M., Calis, N., Sakallioglu, S.: A new algorithm for initial cluster centers in $$k$$ k -means algorithm. Pattern Recognit. Lett. 32, 1701\u20131705 (2011)","journal-title":"Pattern Recognit. Lett."},{"key":"175_CR13","doi-asserted-by":"crossref","unstructured":"Hamerly, G., Elkan, C.: Alternatives to the $$k$$ k -means algorithm that find better clusterings. In: Proceedings of the Eleventh International Conference on Information and Knowledge Management, pp. 600\u2013607. ACM (2002)","DOI":"10.1145\/584792.584890"},{"key":"175_CR14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s003579900019","volume":"15","author":"P Hansen","year":"1998","unstructured":"Hansen, P., Jaumard, B., Mladenovic, N.: Minimum sum of squares clustering in a low dimensional space. J. Classif. 15, 37\u201356 (1998)","journal-title":"J. Classif."},{"key":"175_CR15","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recognit. 34, 405\u2013413 (2001)","journal-title":"Pattern Recognit."},{"key":"175_CR16","first-page":"319","volume":"6","author":"P Hansen","year":"2008","unstructured":"Hansen, P., Mladenovic, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. 4-OR 6, 319\u2013360 (2008)","journal-title":"4-OR"},{"key":"175_CR17","doi-asserted-by":"crossref","first-page":"8679","DOI":"10.1016\/j.eswa.2010.06.061","volume":"37","author":"J Hua","year":"2010","unstructured":"Hua, J., Yi, S., Li, J., et al.: Ant clustering algorithm with K-harmonic means clustering. Expert Syst. Appl. 37, 8679\u20138684 (2010). doi: 10.1016\/j.eswa.2010.06.061","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"175_CR18","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1049\/iet-ipr:20050320","volume":"1","author":"Q Li","year":"2007","unstructured":"Li, Q., Mitianoudis, N., Stathaki, T.: Spatial kernel K-harmonic means clustering for multi-spectral image segmentation. Image Process. IET 1(2), 156\u2013167 (2007)","journal-title":"Image Process. IET"},{"key":"175_CR19","unstructured":"Mladenovi\u0107, N., Brimberg, J.: A degeneracy property in continuous location-allocation problems. Les Cahiers du GERAD, G-96-37 (1996)"},{"key":"175_CR20","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighbourhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"175_CR21","doi-asserted-by":"crossref","first-page":"19","DOI":"10.2298\/YJOR120530015M","volume":"23","author":"N Mladenovic","year":"2013","unstructured":"Mladenovic, N., Todosijevic, R., Urosevic, D.: An efficient general variable neighborhood search for large TSP problem with time windows. Yugosl. J. Oper. Res. 23, 19\u201331 (2013)","journal-title":"Yugosl. J. Oper. Res."},{"key":"175_CR22","first-page":"220","volume":"1","author":"MK Pakhira","year":"2009","unstructured":"Pakhira, M.K.: A modified k-means Algorithm to avoid empty clusters. Int. J. Recent Trends Eng. 1, 220\u2013226 (2009)","journal-title":"Int. J. Recent Trends Eng."},{"key":"175_CR23","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0020-0255(70)80056-1","volume":"2","author":"EH Ruspini","year":"1970","unstructured":"Ruspini, E.H.: Numerical methods for fuzzy clustering. Inf. Sci. 2, 319\u2013350 (1970)","journal-title":"Inf. Sci."},{"key":"175_CR24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00357-007-0003-0","volume":"24","author":"D Steinley","year":"2007","unstructured":"Steinley, D., Brusco, M.J.: Initializing k-means batch clustering: a critical evaluation of several techniques. J. Classif. 24, 99\u2013121 (2007)","journal-title":"J. Classif."},{"key":"175_CR25","volume-title":"Clustering","author":"R Xu","year":"2009","unstructured":"Xu, R., Wunsch, D.: Clustering. IEEE Press, New York (2009)"},{"key":"175_CR26","doi-asserted-by":"crossref","first-page":"9847","DOI":"10.1016\/j.eswa.2009.02.003","volume":"36","author":"Fengqin Yang","year":"2009","unstructured":"Yang, Fengqin, Sun, Tieli, Zhang, Changhai: An efficient hybrid data clustering method based on K-harmonic means and particle swarm optimization original research article. Expert Syst. Appl. 36, 9847\u20139852 (2009)","journal-title":"Expert Syst. Appl."},{"key":"175_CR27","doi-asserted-by":"crossref","first-page":"9319","DOI":"10.1016\/j.eswa.2011.01.018","volume":"38","author":"M Yin","year":"2011","unstructured":"Yin, M., Hu, Y., Yang, F., et al.: A novel hybrid K-harmonic means and gravitational search algorithm approach for clustering. Expert Syst. Appl. 38, 9319\u20139324 (2011). doi: 10.1016\/j.eswa.2011.01.018","journal-title":"Expert Syst. Appl."},{"key":"175_CR28","unstructured":"Zhang, B.: Generalized k-harmonic means\u2014boosting in unsupervised learning. Technical Report, HPL-2000-137, Hewlett-Packard Laboratories (2000)"},{"key":"175_CR29","unstructured":"Zhang, B., Hsu, M., Dayal, U.: K-harmonic means\u2014a data clustering algorithm. Technical Report, HPL-1999-124, Hewlett-Packard Laboratories (1999)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0175-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0175-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0175-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:06Z","timestamp":1559278746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0175-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,6]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0175-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,6]]}}}