{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T23:47:47Z","timestamp":1775000867851,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032157904","type":"print"},{"value":"9783032157911","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-15791-1_2","type":"book-chapter","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T22:47:43Z","timestamp":1774997263000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mahalanobis-Distance-Based Clustering via\u00a0DC Optimization Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4579-3927","authenticated-orcid":false,"given":"Tatiana V.","family":"Gruzdeva","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8289-6266","authenticated-orcid":false,"given":"Anton V.","family":"Ushakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,1]]},"reference":[{"key":"2_CR1","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.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75, 245\u2013248 (2009). https:\/\/doi.org\/10.1007\/s10994-009-5103-0","journal-title":"Mach. Learn."},{"key":"2_CR2","unstructured":"Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 1027\u20131035. SIAM, Philadelphia (2007)"},{"issue":"10","key":"2_CR3","doi-asserted-by":"publisher","first-page":"3192","DOI":"10.1016\/j.patcog.2008.04.004","volume":"41","author":"AM Bagirov","year":"2008","unstructured":"Bagirov, A.M.: Modified global k-means algorithm for minimum sum-of-squares clustering problems. Pattern Recognit. 41(10), 3192\u20133199 (2008). https:\/\/doi.org\/10.1016\/j.patcog.2008.04.004","journal-title":"Pattern Recognit."},{"key":"2_CR4","first-page":"1705","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J.: Clustering with Bregman divergences. J. Mach. Learn. Res. 6, 1705\u20131749 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10898-014-0175-1","volume":"63","author":"E Carrizosa","year":"2015","unstructured":"Carrizosa, E., Alguwaizani, A., Hansen, P., Mladenovi\u0107, N.: New heuristic for harmonic means clustering. J. Glob. Optim. 63, 427\u2013443 (2015). https:\/\/doi.org\/10.1007\/s10898-014-0175-1","journal-title":"J. Glob. Optim."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0304-3800(02)00327-7","volume":"160","author":"O Farber","year":"2003","unstructured":"Farber, O., Kadmon, R.: Assessment of alternative approaches for bioclimatic modeling with special emphasis on the mahalanobis distance. Ecol. Model. 160(1), 115\u2013130 (2003). https:\/\/doi.org\/10.1016\/S0304-3800(02)00327-7","journal-title":"Ecol. Model."},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.ejor.2020.08.045","volume":"290","author":"C Gambella","year":"2021","unstructured":"Gambella, C., Ghaddar, B., Naoum-Sawaya, J.: Optimization problems for machine learning: a survey. Eur. J. Oper. Res. 290(3), 807\u2013828 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.08.045","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.patcog.2018.12.022","volume":"88","author":"D Gribel","year":"2019","unstructured":"Gribel, D., Vidal, T.: Hg-means: a scalable hybrid genetic algorithm for minimum sum-of-squares clustering. Pattern Recognit. 88, 569\u2013583 (2019). https:\/\/doi.org\/10.1016\/j.patcog.2018.12.022","journal-title":"Pattern Recognit."},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-91059-4_6","volume-title":"Optimization and Applications","author":"TV Gruzdeva","year":"2021","unstructured":"Gruzdeva, T.V., Ushakov, A.V.: A computational study of the DC minimization global optimality conditions applied to K-means clustering. In: Olenev, N.N., Evtushenko, Y.G., Ja\u0107imovi\u0107, M., Khachay, M., Malkova, V. (eds.) OPTIMA 2021. LNCS, vol. 13078, pp. 79\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91059-4_6"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-030-77876-7_31","volume-title":"Mathematical Optimization Theory and Operations Research","author":"TV Gruzdeva","year":"2021","unstructured":"Gruzdeva, T.V., Ushakov, A.V.: K-means clustering via a nonconvex optimization approach. In: Pardalos, P., Khachay, M., Kazakov, A. (eds.) MOTOR 2021. LNCS, vol. 12755, pp. 462\u2013476. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77876-7_31"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Gruzdeva, T.V., Ushakov, A.V.: On a nonconvex distance-based clustering problem. In: Pardalos, P., Khachay, M., Mazalov, V. (eds.) MOTOR 2022. LNCS, vol. 13367, pp. 139\u2013152. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09607-5_10","DOI":"10.1007\/978-3-031-09607-5_10"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10618-009-0135-4","volume":"19","author":"P Hansen","year":"2009","unstructured":"Hansen, P., Brimberg, J., Urosevi\u0107, D., Mladenovi\u0107, N.: Solving large p-median clustering problems by primal-dual variable neighborhood search. Data Min. Knowl. Discov. 19(3), 351\u2013375 (2009). https:\/\/doi.org\/10.1007\/s10618-009-0135-4","journal-title":"Data Min. Knowl. Discov."},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recognit. 34(2), 405\u2013413 (2001). https:\/\/doi.org\/10.1016\/S0031-3203(99)00216-2","journal-title":"Pattern Recognit."},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02614317","volume":"79","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Math. Program. 79(1), 191\u2013215 (1997)","journal-title":"Math. Program."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"LT Hoai An","year":"2005","unstructured":"Hoai An, L.T., Tao, P.D.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/j.patcog.2018.02.015","volume":"79","author":"H Ismkhan","year":"2018","unstructured":"Ismkhan, H.: I-k-means-+: an iterative clustering algorithm based on an enhanced version of the k-means. Pattern Recognit. 79, 402\u2013413 (2018). https:\/\/doi.org\/10.1016\/j.patcog.2018.02.015","journal-title":"Pattern Recognit."},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Kulis, B.: Metric learning: a survey. Found. Trends\u00ae Mach. Learn. 5(4), 287\u2013364 (2013). https:\/\/doi.org\/10.1561\/2200000019","DOI":"10.1561\/2200000019"},{"issue":"2","key":"2_CR18","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, J.J.: The global k-means clustering algorithm. Pattern Recognit. 36(2), 451\u2013461 (2003). https:\/\/doi.org\/10.1016\/S0031-3203(02)00060-2","journal-title":"Pattern Recognit."},{"issue":"12","key":"2_CR19","doi-asserted-by":"publisher","first-page":"2680","DOI":"10.1016\/j.ins.2008.01.022","volume":"178","author":"Y Liu","year":"2008","unstructured":"Liu, Y., Yi, Z., Wu, H., Ye, M., Chen, K.: A tabu search approach for the minimum sum-of-squares clustering problem. Inf. Sci. 178(12), 2680\u20132704 (2008). https:\/\/doi.org\/10.1016\/j.ins.2008.01.022","journal-title":"Inf. Sci."},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar k-means problem is NP-hard. Theor. Comput. Sci. 442, 13\u201321 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2010.05.034. Special Issue on the Workshop on Algorithms and Computation (WALCOM 2009)","DOI":"10.1016\/j.tcs.2010.05.034"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"107849","DOI":"10.1016\/j.patcog.2021.107849","volume":"114","author":"P Mansueto","year":"2021","unstructured":"Mansueto, P., Schoen, F.: Memetic differential evolution methods for clustering problems. Pattern Recognit. 114, 107849 (2021). https:\/\/doi.org\/10.1016\/j.patcog.2021.107849","journal-title":"Pattern Recognit."},{"key":"2_CR23","series-title":"Operations Research and Financial Engineering","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006)","edition":"2"},{"issue":"5","key":"2_CR24","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1016\/j.cor.2003.11.006","volume":"32","author":"JA Pacheco","year":"2005","unstructured":"Pacheco, J.A.: A scatter search approach for the minimum sum-of-squares clustering problem. Comput. Oper. Res. 32(5), 1325\u20131335 (2005). https:\/\/doi.org\/10.1016\/j.cor.2003.11.006","journal-title":"Comput. Oper. Res."},{"key":"2_CR25","unstructured":"Russell, B., Lines, L.: Mahalanobis clustering, with applications to AVO classification and seismic reservoir parameter estimation. CREWES Res. Rep. 15, 1\u201324 (2003). https:\/\/www.crewes.org\/Documents\/ResearchReports\/2003\/2003-52.pdf"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Strekalovsky, A.S.: On solving optimization problems with hidden nonconvex structures. In: Rassias, T., Floudas, C., Butenko, S. (eds.) Optimization in Science and Engineering, pp. 465\u2013502. Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-1-4939-0808-0_23","DOI":"10.1007\/978-1-4939-0808-0_23"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Strekalovsky, A.S.: On local search in D.C. optimization problems. Appl. Math. Comput. 255, 73\u201383 (2015)","DOI":"10.1016\/j.amc.2014.08.092"},{"key":"2_CR28","first-page":"380","volume":"43","author":"A Strekalovsky","year":"2003","unstructured":"Strekalovsky, A.: On the minimization of the difference of convex functions on a feasible set. Comput. Math. Math. Phys. 43, 380\u2013390 (2003)","journal-title":"Comput. Math. Math. Phys."},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2020.08.121","volume":"545","author":"AV Ushakov","year":"2021","unstructured":"Ushakov, A.V., Vasilyev, I.: Near-optimal large-scale k-medoids clustering. Inf. Sci. 545, 344\u2013362 (2021). https:\/\/doi.org\/10.1016\/j.ins.2020.08.121","journal-title":"Inf. Sci."},{"issue":"1","key":"2_CR30","first-page":"229","volume":"13","author":"AV Ushakov","year":"2015","unstructured":"Ushakov, A.V., Vasilyev, I.L., Gruzdeva, T.V.: A computational comparison of the p-median clustering and k-means. Int. J. Artif. Intell. 13(1), 229\u2013242 (2015)","journal-title":"Int. J. Artif. Intell."},{"issue":"4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1134\/S1990478921040128","volume":"15","author":"IL Vasilyev","year":"2021","unstructured":"Vasilyev, I.L., Ushakov, A.V.: Discrete facility location in machine learning. J. Appl. Ind. Math. 15(4), 686\u2013710 (2021). https:\/\/doi.org\/10.1134\/S1990478921040128","journal-title":"J. Appl. Ind. Math."},{"key":"2_CR32","first-page":"521","volume":"15","author":"E Xing","year":"2003","unstructured":"Xing, E., Ng, A., Jordan, M., Russell, S.: Distance metric learning, with application to clustering with side-information. Adv. Neural. Inf. Process. Syst. 15, 521\u2013528 (2003)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15791-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T22:47:45Z","timestamp":1774997265000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15791-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032157904","9783032157911"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15791-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"1 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf-optima.ru","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}