{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T03:47:04Z","timestamp":1767844024047,"version":"3.49.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T00:00:00Z","timestamp":1658707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["RTG 2126 Algorithmic Optimization"],"award-info":[{"award-number":["RTG 2126 Algorithmic Optimization"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:italic>k<\/jats:italic>-means clustering is a classic method of unsupervised learning with the aim of partitioning a given number of measurements into <jats:italic>k<\/jats:italic> clusters. In many modern applications, however, this approach suffers from unstructured measurement errors because the <jats:italic>k<\/jats:italic>-means clustering result then represents a clustering of the erroneous measurements instead of retrieving the true underlying clustering structure. We resolve this issue by applying techniques from robust optimization to hedge the clustering result against unstructured errors in the observed data. To this end, we derive the strictly and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Gamma $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u0393<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-robust counterparts of the <jats:italic>k<\/jats:italic>-means clustering problem. Since the nominal problem is already NP-hard, global approaches are often not feasible in practice. As a remedy, we develop tailored alternating direction methods by decomposing the search space of the nominal as well as of the robustified problems to quickly obtain feasible points of good quality. Our numerical results reveal an interesting feature: the less conservative <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Gamma $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u0393<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-approach is clearly outperformed by the strictly robust clustering method. In particular, the strictly robustified clustering method is able to recover clusterings of the original data even if only erroneous measurements are observed.<\/jats:p>","DOI":"10.1007\/s10479-022-04818-w","type":"journal-article","created":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T13:03:21Z","timestamp":1658754201000},"page":"1525-1568","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Robustification of the k-means clustering problem and tailored decomposition methods: when more conservative means more accurate"],"prefix":"10.1007","volume":"339","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5771-6179","authenticated-orcid":false,"given":"Jan Pablo","family":"Burgard","sequence":"first","affiliation":[]},{"given":"Carina","family":"Moreira Costa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6208-5677","authenticated-orcid":false,"given":"Martin","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,25]]},"reference":[{"issue":"2","key":"4818_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1111\/j.1467-9876.2012.01063.x","volume":"62","author":"A Alfons","year":"2013","unstructured":"Alfons, A., Templ, M., & Filzmoser, P. (2013). Robust estimation of economic indicators from survey samples based on Pareto tail modelling. Journal of the Royal Statistical Society. Series C (Applied Statistics), 62(2), 271\u2013286. https:\/\/doi.org\/10.1111\/j.1467-9876.2012.01063.x.","journal-title":"Journal of the Royal Statistical Society. Series C (Applied Statistics)"},{"key":"4818_CR2","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. Machine Learning, 75, 245\u2013248. https:\/\/doi.org\/10.1007\/s10994-009-5103-0","journal-title":"Machine Learning"},{"key":"4818_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10107-010-0349-7","volume":"131","author":"D Aloise","year":"2012","unstructured":"Aloise, D., Hansen, P., & Liberti, L. (2012). An improved column generation algorithm for minimum sum-of-squares clustering. Mathematical Programming, 131, 195\u2013220. https:\/\/doi.org\/10.1007\/s10107-010-0349-7","journal-title":"Mathematical Programming"},{"issue":"1","key":"4818_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10107-013-0729-x","volume":"147","author":"BPW Ames","year":"2014","unstructured":"Ames, B. P. W. (2014). Guaranteed clustering and biclustering via semidefinite programming. Mathematical Programming, 147(1), 429\u2013465. https:\/\/doi.org\/10.1007\/s10107-013-0729-x","journal-title":"Mathematical Programming"},{"issue":"1","key":"4818_CR5","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, J. M., & Perona, I. (2013). An extensive comparative study of cluster validity indices. Pattern Recognition, 46(1), 243\u2013256. https:\/\/doi.org\/10.1016\/j.patcog.2012.07.021","journal-title":"Pattern Recognition"},{"key":"4818_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust optimization (Vol. 28). Princeton University Press.","DOI":"10.1515\/9781400831050"},{"issue":"2","key":"4818_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., & Nemirovski, A. (2004). Adjustable robust solutions of uncertain linear programs. Mathematical Programming, 99(2), 351\u2013376. https:\/\/doi.org\/10.1007\/s10107-003-0454-y","journal-title":"Mathematical Programming"},{"key":"4818_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., & Nemirovski, A. (2001). Lectures on modern convex optimization. Society for Industrial and Applied Mathematics. https:\/\/doi.org\/10.1137\/1.9780898718829","journal-title":"Society for Industrial and Applied Mathematics"},{"key":"4818_CR9","unstructured":"Bertsekas, D. P., & Tsitsiklis, J. N. (1989). Parallel and distributed computation: Numerical methods. Prentice-Hall Inc."},{"issue":"3","key":"4818_CR10","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D. B., & Caramanis, C. (2011). Theory and applications of robust optimization. SIAM Review, 53(3), 464\u2013501. https:\/\/doi.org\/10.1137\/080734510","journal-title":"SIAM Review"},{"issue":"1","key":"4818_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/ijoo.2018.0001","volume":"1","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Dunn, J., Pawlowski, C., & Zhuo, Y. D. (2019). Robust classification. INFORMS Journal on Optimization, 1(1), 2\u201334. https:\/\/doi.org\/10.1287\/ijoo.2018.0001","journal-title":"INFORMS Journal on Optimization"},{"issue":"1","key":"4818_CR12","first-page":"7133","volume":"18","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Pawlowski, C., & Zhuo, Y. D. (2017). From predictive methods to missing data imputation: An optimization approach. The Journal of Machine Learning Research, 18(1), 7133\u20137171.","journal-title":"The Journal of Machine Learning Research"},{"issue":"1","key":"4818_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35\u201353. https:\/\/doi.org\/10.1287\/opre.1030.0065","journal-title":"Operations Research"},{"key":"4818_CR14","unstructured":"Bhattacharyya, C., Pannagadatta, K. S., & Smola, A. J. (2005) A second order cone programming formulation for classifying missing data. In Proceedings of the 17th international conference on neural information processing systems (pp. 153\u2013160). MIT Press."},{"issue":"1","key":"4818_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1), 1\u2013122. https:\/\/doi.org\/10.1561\/2200000016","journal-title":"Foundations and Trends in Machine Learning"},{"key":"4818_CR16","doi-asserted-by":"crossref","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press.","DOI":"10.1017\/CBO9780511804441"},{"key":"4818_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s00362-020-01214-z","author":"JP Burgard","year":"2020","unstructured":"Burgard, J. P., Krause, J., Kreber, D., & Morales, D. (2020). The generalized equivalence of regularization and min\u2013max robustification in linear mixed models. Statistical Papers. https:\/\/doi.org\/10.1007\/s00362-020-01214-z","journal-title":"Statistical Papers"},{"issue":"10","key":"4818_CR18","doi-asserted-by":"publisher","first-page":"2856","DOI":"10.1016\/j.csda.2010.11.002","volume":"56","author":"JP Burgard","year":"2012","unstructured":"Burgard, J. P., & M\u00fcnnich, R. T. (2012). Modelling over and undercounts for design-based Monte Carlo studies in small area estimation: An application to the German register-assisted census. Computational Statistics & Data Analysis, 56(10), 2856\u20132863. https:\/\/doi.org\/10.1016\/j.csda.2010.11.002","journal-title":"Computational Statistics & Data Analysis"},{"key":"4818_CR19","doi-asserted-by":"crossref","unstructured":"Carroll, R. J., Ruppert, D., Stefanski, L. A., & Crainiceanu, C. M. (2006). Measurement error in nonlinear models: A modern perspective. CRC Press.","DOI":"10.1201\/9781420010138"},{"key":"4818_CR20","doi-asserted-by":"publisher","unstructured":"Celebi, M. E., & Aydin, K. (2016). Unsupervised learning algorithms. Springer. https:\/\/doi.org\/10.1007\/978-3-319-24211-8","DOI":"10.1007\/978-3-319-24211-8"},{"key":"4818_CR21","unstructured":"Dasgupta, S. (2007) The hardness of k-means clustering. Technical Report CS2008-0916. University of California, Department of Computer Science and Engineering. http:\/\/cseweb.ucsd.edu\/~dasgupta\/papers\/kmeans.pdf"},{"issue":"3","key":"4818_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.19080\/BBOAJ.2017.01.555563","volume":"1","author":"S Davalos","year":"2017","unstructured":"Davalos, S. (2017). Big data has a big role in biostatistics with big challenges and big expectations. Biostatistics and Biometrics Open Access Journal, 1(3), 1\u20132. https:\/\/doi.org\/10.19080\/BBOAJ.2017.01.555563","journal-title":"Biostatistics and Biometrics Open Access Journal"},{"key":"4818_CR23","unstructured":"Dua, D., & Graff, C. (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"4818_CR24","doi-asserted-by":"publisher","unstructured":"Fischetti, M., & Monaci, M. (2009) Light robustness. In Ahuja, R. K., M\u00f6hring, R. H., & Zaroliagis, C. D. (Eds.) Robust and online large-scale optimization: Models and techniques for transportation systems (pp. 61\u201384). Springer. https:\/\/doi.org\/10.1007\/978-3-642-05465-5_3","DOI":"10.1007\/978-3-642-05465-5_3"},{"key":"4818_CR25","doi-asserted-by":"publisher","unstructured":"Fraiman, R., Ghattas, B., & Svarc, M. (2013). Interpretable clustering using unsupervised binary trees.https:\/\/doi.org\/10.1007\/s11634-013-0129-3","DOI":"10.1007\/s11634-013-0129-3"},{"issue":"12","key":"4818_CR26","doi-asserted-by":"publisher","first-page":"4743","DOI":"10.1007\/s10489-018-1238-7","volume":"48","author":"P Fr\u00e4nti","year":"2018","unstructured":"Fr\u00e4nti, P., & Sieranoja, S. (2018). k-means properties on six clustering benchmark datasets. Applied Intelligence, 48(12), 4743\u20134759. https:\/\/doi.org\/10.1007\/s10489-018-1238-7","journal-title":"Applied Intelligence"},{"key":"4818_CR27","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 Recognition, 93, 95\u2013112. https:\/\/doi.org\/10.1016\/j.patcog.2019.04.014","journal-title":"Pattern Recognition"},{"issue":"1","key":"4818_CR28","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., & Mercier, B. (1976). A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Computers & Mathematics with Applications, 2(1), 17\u201340. https:\/\/doi.org\/10.1016\/0898-1221(76)90003-1","journal-title":"Computers & Mathematics with Applications"},{"key":"4818_CR29","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.compchemeng.2015.07.005","volume":"82","author":"B Gei\u00dfler","year":"2015","unstructured":"Gei\u00dfler, B., Morsi, A., Schewe, L., & Schmidt, M. (2015). Solving power-constrained gas transportation problems using an MIP-based alternating direction method. Computers & Chemical Engineering, 82, 303\u2013317. https:\/\/doi.org\/10.1016\/j.compchemeng.2015.07.005","journal-title":"Computers & Chemical Engineering"},{"key":"4818_CR30","doi-asserted-by":"publisher","DOI":"10.1137\/16M1069687","author":"B Gei\u00dfler","year":"2017","unstructured":"Gei\u00dfler, B., Morsi, A., Schewe, L., & Schmidt, M. (2017). Penalty alternating direction methods for mixed-integer optimization: A new view on feasibility pumps. SIAM Journal on Optimization. https:\/\/doi.org\/10.1137\/16M1069687","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"4818_CR31","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1287\/ijoc.2017.0780","volume":"30","author":"B Gei\u00dfler","year":"2018","unstructured":"Gei\u00dfler, B., Morsi, A., Schewe, L., & Schmidt, M. (2018). Solving highly detailed gas transport MINLPs: Block separability and penalty alternating direction methods. INFORMS Journal on Computing, 30(2), 309\u2013323. https:\/\/doi.org\/10.1287\/ijoc.2017.0780","journal-title":"INFORMS Journal on Computing"},{"key":"4818_CR32","doi-asserted-by":"crossref","unstructured":"Glowinski, R., & Marroco, A. (1975) Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de Dirichlet non lin\u00e9aires. In ESAIM: Mathematical Modelling and Numerical Analysis - Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique 9.R2 (pp. 41\u201376). http:\/\/eudml.org\/doc\/193269","DOI":"10.1051\/m2an\/197509R200411"},{"issue":"3","key":"4818_CR33","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00186-007-0161-1","volume":"66","author":"J Gorski","year":"2007","unstructured":"Gorski, J., Pfeuffer, F., & Klamroth, K. (2007). Biconvex sets and optimization with biconvex functions: A survey and extensions. Mathematical Methods of Operations Research, 66(3), 373\u2013407. https:\/\/doi.org\/10.1007\/s00186-007-0161-1","journal-title":"Mathematical Methods of Operations Research"},{"key":"4818_CR34","first-page":"9","volume":"1","author":"N Grira","year":"2004","unstructured":"Grira, N., Crucianu, M., & Boujemaa, N. (2004). Unsupervised and semi-supervised clustering: A brief survey. A Review of Machine Learning Techniques for Processing Multimedia Content, 1, 9\u201316.","journal-title":"A Review of Machine Learning Techniques for Processing Multimedia Content"},{"key":"4818_CR35","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., & Arabie, P. (1985). Comparing partitions. Journal of Classification, 2, 193\u2013218. https:\/\/doi.org\/10.1007\/BF01908075","journal-title":"Journal of Classification"},{"issue":"6213","key":"4818_CR36","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1126\/science.aaa2709","volume":"346","author":"MJ Khoury","year":"2014","unstructured":"Khoury, M. J., & Ioannidis, J. P. A. (2014). Big data meets public health. Science, 346(6213), 1054\u20131055. https:\/\/doi.org\/10.1126\/science.aaa2709","journal-title":"Science"},{"key":"4818_CR37","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/4321928","author":"J Li","year":"2016","unstructured":"Li, J., Song, S., Zhang, Y., & Zhou, Z. (2016). Robust k-median and k-means clustering algorithms for incomplete data. Mathematical Problems in Engineering. https:\/\/doi.org\/10.1155\/2016\/4321928","journal-title":"Mathematical Problems in Engineering"},{"key":"4818_CR38","doi-asserted-by":"publisher","unstructured":"Liebchen, C., L\u00fcbbecke, M., M\u00f6hring, R., & Stiller, S. (2009) Robust and online large-scale optimization: Models and techniques for transportation systems. In Ahuja, R. K., M\u00f6hring, R. H., & Zaroliagis, C. D. (Eds.) Chap. The concept of recoverable robustness, linear programming recovery, and railway applications (pp. 1\u201327). Springer.https:\/\/doi.org\/10.1007\/978-3-642-05465-5_1.","DOI":"10.1007\/978-3-642-05465-5_1"},{"issue":"2","key":"4818_CR39","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 Transactions on Information Theory, 28(2), 129\u2013137. https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Transactions on Information Theory"},{"key":"4818_CR40","unstructured":"MacQueen, J. (1967)\u201cSome methods for classification and analysis of multivariate observations.\u201d In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, Volume 1: Statistics (pp. 281\u2013297). University of California Press. https:\/\/projecteuclid.org\/euclid.bsmsp\/1200512992"},{"key":"4818_CR41","doi-asserted-by":"publisher","unstructured":"Mahajan, M., Nimbhorkar, P., & Varadarajan, K. (2012) The planar k-means problem is NP-hard. In Theoretical computer science 442. Special issue on the workshop on algorithms and computation (WALCOM 2009) (pp. 13\u201321). https:\/\/doi.org\/10.1016\/j.tcs.2010.05.034","DOI":"10.1016\/j.tcs.2010.05.034"},{"key":"4818_CR42","unstructured":"Pant, R., Trafalis, T. B., & Barker, K. (2011) Support vector machine classification of uncertain and imbalanced data using robust optimization. In Proceedings of the 15th WSEAS international conference on computers (pp. 369\u2013374). World Scientific, Engineering Academy, and Society (WSEAS)."},{"issue":"1","key":"4818_CR43","first-page":"1007","volume":"20","author":"A Pirinen","year":"2019","unstructured":"Pirinen, A., & Ames, B. (2019). Exact clustering of weighted graphs via semidefinite programming. The Journal of Machine Learning Research, 20(1), 1007\u20131040.","journal-title":"The Journal of Machine Learning Research"},{"issue":"6","key":"4818_CR44","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1093\/bioinformatics\/btp038","volume":"25","author":"DM Rocke","year":"2009","unstructured":"Rocke, D. M., Ideker, T., Troyanskaya, O., Quackenbush, J., & Dopazo, J. (2009). Papers on normalization, variable selection, classification or clustering of microarray data. Bioinformatics, 25(6), 701\u2013702. https:\/\/doi.org\/10.1093\/bioinformatics\/btp038","journal-title":"Bioinformatics"},{"key":"4818_CR45","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P. J. (1987). Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. Journal of Computational and Applied Mathematics, 20, 53\u201365. https:\/\/doi.org\/10.1016\/0377-0427(87)90125-7","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"3","key":"4818_CR46","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.orl.2020.02.006","volume":"48","author":"L Schewe","year":"2020","unstructured":"Schewe, L., Schmidt, M., & Weninger, D. (2020). A decomposition heuristic for mixed-integer supply chain problems. Operations Research Letters, 48(3), 225\u2013232. https:\/\/doi.org\/10.1016\/j.orl.2020.02.006","journal-title":"Operations Research Letters"},{"issue":"5","key":"4818_CR47","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster, A. L. (1973). Technical note-convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research, 21(5), 1154\u20131157. https:\/\/doi.org\/10.1287\/opre.21.5.1154","journal-title":"Operations Research"},{"issue":"3","key":"4818_CR48","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1037\/1082-989X.9.3.386","volume":"9","author":"D Steinley","year":"2004","unstructured":"Steinley, D. (2004). Properties of the Hubert\u2013Arable adjusted rand index. Psychological Methods, 9(3), 386\u2013396. https:\/\/doi.org\/10.1037\/1082-989X.9.3.386","journal-title":"Psychological Methods"},{"issue":"4","key":"4818_CR49","first-page":"2337","volume":"28","author":"Y Su","year":"2018","unstructured":"Su, Y., Reedy, J., & Carroll, R. J. (2018). Clustering in general measurement error models. Statistica Sinica, 28(4), 2337.","journal-title":"Statistica Sinica"},{"issue":"1","key":"4818_CR50","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1080\/10556780600883791","volume":"22","author":"TB Trafalis","year":"2007","unstructured":"Trafalis, T. B., & Gilbert, R. C. (2007). Robust support vector machines for classification and computational issues. Optimization Methods and Software, 22(1), 187\u2013198. https:\/\/doi.org\/10.1080\/10556780600883791","journal-title":"Optimization Methods and Software"},{"key":"4818_CR51","doi-asserted-by":"publisher","unstructured":"Vo, X. T., Le Thi, H. A., & Pham Dinh, T. (2016) Robust optimization for clustering. In Intelligent information and database systems (pp. 671\u2013680). Springer. https:\/\/doi.org\/10.1007\/978-3-662-49390-8_65","DOI":"10.1007\/978-3-662-49390-8_65"},{"issue":"4","key":"4818_CR52","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17(4), 395\u2013416. https:\/\/doi.org\/10.1007\/s11222-007-9033-z","journal-title":"Statistics and Computing"},{"issue":"4","key":"4818_CR53","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1287\/opre.24.4.643","volume":"24","author":"RE Wendell","year":"1976","unstructured":"Wendell, R. E., & Hurter, A. P. (1976). Minimization of a non-separable objective function subject to disjoint constraints. Operations Research, 24(4), 643\u2013657. https:\/\/doi.org\/10.1287\/opre.24.4.643","journal-title":"Operations Research"},{"key":"4818_CR54","first-page":"143","volume":"163","author":"E White","year":"2011","unstructured":"White, E. (2011). Measurement error in biomarkers: Sources, assessment, and impact on studies. IARC Scientific Publications, 163, 143\u2013161.","journal-title":"IARC Scientific Publications"},{"issue":"6","key":"4818_CR55","doi-asserted-by":"publisher","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80\u201383. https:\/\/doi.org\/10.2307\/3001968","journal-title":"Biometrics Bulletin"},{"issue":"11","key":"4818_CR56","doi-asserted-by":"publisher","first-page":"852","DOI":"10.3390\/e20110852","volume":"20","author":"K Yamada","year":"2018","unstructured":"Yamada, K., Takayasu, H., & Takayasu, M. (2018). Estimation of economic indicator announced by government from social big data. Entropy, 20(11), 852\u2013864. https:\/\/doi.org\/10.3390\/e20110852","journal-title":"Entropy"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04818-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-04818-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04818-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T12:19:50Z","timestamp":1723551590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-04818-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,25]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["4818"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-04818-w","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,25]]},"assertion":[{"value":"6 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}