{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:13:44Z","timestamp":1740147224883,"version":"3.37.3"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:00:00Z","timestamp":1656374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:00:00Z","timestamp":1656374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many applications in data analysis study whether two categorical variables are independent using a function of the entries of their contingency table. Often, the categories of the variables, associated with the rows and columns of the table, are grouped, yielding a less granular representation of the categorical variables. The purpose of this is to attain reasonable sample sizes in the cells of the table and, more importantly, to incorporate expert knowledge on the allowable groupings. However, it is known that the conclusions on independence depend, in general, on the chosen granularity, as in the Simpson paradox. In this paper we propose a methodology to, for a given contingency table and a fixed granularity, find a clustered table with the highest <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\chi ^2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>\u03c7<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> statistic. Repeating this procedure for different values of the granularity, we can either identify an <jats:italic>extreme grouping<\/jats:italic>, namely the largest granularity for which the statistical dependence is still detected, or conclude that it does not exist and that the two variables are dependent regardless of the size of the clustered table. For this problem, we propose an assignment mathematical formulation and a set partitioning one. Our approach is flexible enough to include constraints on the desirable structure of the clusters, such as must-link or cannot-link constraints on the categories that can, or cannot, be merged together, and ensure reasonable sample sizes in the cells of the clustered table from which trustful statistical conclusions can be derived. We illustrate the usefulness of our methodology using a dataset of a medical study. \n<\/jats:p>","DOI":"10.1007\/s11634-022-00508-4","type":"journal-article","created":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T11:05:55Z","timestamp":1656414355000},"page":"407-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On mathematical optimization for clustering categories in contingency tables"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0832-8700","authenticated-orcid":false,"given":"Emilio","family":"Carrizosa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6610-7455","authenticated-orcid":false,"given":"Vanesa","family":"Guerrero","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7945-1469","authenticated-orcid":false,"given":"Dolores","family":"Romero Morales","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,28]]},"reference":[{"issue":"2","key":"508_CR1","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1108\/IJICC-04-2018-0046","volume":"12","author":"AA Abin","year":"2019","unstructured":"Abin AA (2019) Clustering in the presence of side information: a non-linear approach. Int J Intel Comput Cybern 12(2):292\u2013314","journal-title":"Int J Intel Comput Cybern"},{"issue":"11","key":"508_CR2","doi-asserted-by":"publisher","first-page":"3216","DOI":"10.1016\/j.jspi.2007.03.006","volume":"137","author":"A Agresti","year":"2007","unstructured":"Agresti A, Gottard A (2007) Independence in multi-way contingency tables: S.N. Roy\u2019s breakthroughs and later developments. J Stat Plan Inference 137(11):3216\u20133226","journal-title":"J Stat Plan Inference"},{"key":"508_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-9473(87)90003-X","volume":"5","author":"A Agresti","year":"1987","unstructured":"Agresti A, Yang MC (1987) An empirical investigation of some effects of sparseness in contingency tables. Comput Stat Dat Anal 5:9\u201321","journal-title":"Comput Stat Dat Anal"},{"key":"508_CR4","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.knosys.2016.07.002","volume":"109","author":"M Ailem","year":"2016","unstructured":"Ailem M, Role F, Nadif M (2016) Graph modularity maximization as an effective method for co-clustering text data. Knowl-Based Syst 109:160\u2013173","journal-title":"Knowl-Based Syst"},{"key":"508_CR5","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.patcog.2017.06.005","volume":"72","author":"M Ailem","year":"2017","unstructured":"Ailem M, Role F, Nadif M (2017) Model-based co-clustering for the effective handling of sparse data. Pattern Recogn 72:108\u2013122","journal-title":"Pattern Recogn"},{"issue":"7","key":"508_CR6","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1109\/TKDE.2017.2681669","volume":"29","author":"M Ailem","year":"2017","unstructured":"Ailem M, Role F, Nadif M (2017) Sparse Poisson latent block model for document clustering. IEEE Trans Knowl Data Eng 29(7):1563\u20131576","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"508_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.csda.2018.05.012","volume":"127","author":"P \u00c1lvarez de Toledo","year":"2018","unstructured":"\u00c1lvarez de Toledo P, N\u00fa\u00f1ez F, Usabiaga C (2018) Matching and clustering in square contingency tables. Who matches with whom in the Spanish labour market. Comput Stat Dat Anal 127:135\u2013159","journal-title":"Comput Stat Dat Anal"},{"key":"508_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-020-01474-5","volume":"183","author":"R Anderson","year":"2020","unstructured":"Anderson R, Huchette J, Ma W, Tjandraatmadja C, Vielma JP (2020) Strong mixed-integer programming formulations for trained neural networks. Math Program 183:3\u201339","journal-title":"Math Program"},{"issue":"3","key":"508_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1287\/mnsc.49.3.312.12739","volume":"49","author":"B Baesens","year":"2003","unstructured":"Baesens B, Setiono R, Mues C, Vanthienen J (2003) Using neural network rule extraction and decision tables for credit-risk evaluation. Manage Sci 49(3):312\u2013329","journal-title":"Manage Sci"},{"key":"508_CR10","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.cor.2013.10.005","volume":"43","author":"S Benati","year":"2014","unstructured":"Benati S, Garc\u00eda S (2014) A mixed integer linear model for clustering with variable selection. Comput Oper Res 43:280\u2013285","journal-title":"Comput Oper Res"},{"issue":"1","key":"508_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/opre.2015.1436","volume":"64","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas D, King A (2016) OR forum - An algorithmic approach to linear regression. Oper Res 64(1):2\u201316","journal-title":"Oper Res"},{"issue":"2","key":"508_CR12","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1287\/opre.1060.0360","volume":"55","author":"D Bertsimas","year":"2007","unstructured":"Bertsimas D, Shioda R (2007) Classification and regression via integer optimization. Oper Res 55(2):252\u2013271","journal-title":"Oper Res"},{"issue":"1","key":"508_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ejor.2019.12.002","volume":"284","author":"R Blanquero","year":"2020","unstructured":"Blanquero R, Carrizosa E, Molero-R\u00edo C, Romero Morales D (2020) Sparsity in optimal randomized classification trees. Eur J Oper Res 284(1):255\u2013272","journal-title":"Eur J Oper Res"},{"issue":"338","key":"508_CR14","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1080\/01621459.1972.10482387","volume":"67","author":"CR Blyth","year":"1972","unstructured":"Blyth CR (1972) On simpson\u2019s paradox and the sure-thing principle. J Am Stat Assoc 67(338):364\u2013366","journal-title":"J Am Stat Assoc"},{"key":"508_CR15","doi-asserted-by":"crossref","unstructured":"Bock HH (2003) Two-way clustering for contingency tables: maximizing a dependence measure. In: Between data science and applied data analysis, Springer, Heidelberg, Germany, pp 143\u2013154","DOI":"10.1007\/978-3-642-18991-3_17"},{"key":"508_CR16","unstructured":"Bonami P, Lee J (June 2017) Bonmin user\u2019s manual. Technical report, IBM Corporation"},{"issue":"2","key":"508_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou L, Curtis F, Nocedal J (2018) Optimization methods for large-scale machine learning. SIAM Rev 60(2):223\u2013311","journal-title":"SIAM Rev"},{"issue":"1","key":"508_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:MACH.0000019804.29836.05","volume":"55","author":"M Boulle","year":"2004","unstructured":"Boulle M (2004) Khiops: A statistical discretization method of continuous attributes. Mach Learn 55(1):53\u201369","journal-title":"Mach Learn"},{"key":"508_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.cor.2013.04.012","volume":"52","author":"E Carrizosa","year":"2014","unstructured":"Carrizosa E, Guerrero V (2014) rs-Sparse principal component analysis: A mixed integer nonlinear programming approach with VNS. Comput Oper Res 52:349\u2013354","journal-title":"Comput Oper Res"},{"issue":"1","key":"508_CR20","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.cor.2012.05.015","volume":"40","author":"E Carrizosa","year":"2013","unstructured":"Carrizosa E, Romero Morales D (2013) Supervised classification and mathematical optimization. Comput Oper Res 40(1):150\u2013165","journal-title":"Comput Oper Res"},{"issue":"2","key":"508_CR21","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.ejor.2013.04.027","volume":"230","author":"E Carrizosa","year":"2013","unstructured":"Carrizosa E, Mladenovi\u0107 N, Todosijevi\u0107 R (2013) Variable neighborhood search for minimum sum-of-squares clustering on networks. Eur J Oper Res 230(2):356\u2013363","journal-title":"Eur J Oper Res"},{"key":"508_CR22","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.cor.2016.09.018","volume":"78","author":"E Carrizosa","year":"2017","unstructured":"Carrizosa E, Guerrero V, Romero Morales D (2017a) Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach. Comput Oper Res 78:369\u2013380","journal-title":"Comput Oper Res"},{"key":"508_CR23","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.omega.2016.01.008","volume":"66","author":"E Carrizosa","year":"2017","unstructured":"Carrizosa E, Nogales-G\u00f3mez A, Romero Morales D (2017b) Clustering categories in support vector machines. Omega 66:28\u201337","journal-title":"Omega"},{"issue":"1","key":"508_CR24","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2017.07.023","volume":"265","author":"E Carrizosa","year":"2018","unstructured":"Carrizosa E, Guerrero V, Romero Morales D (2018a) On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps. Eur J Oper Res 265(1):290\u2013302","journal-title":"Eur J Oper Res"},{"key":"508_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10107-017-1156-1","volume":"169","author":"E Carrizosa","year":"2018","unstructured":"Carrizosa E, Guerrero V, Romero Morales D (2018b) Visualizing data as objects by DC (difference of convex) optimization. Math Program 169:119\u2013140","journal-title":"Math Program"},{"key":"508_CR26","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.omega.2018.07.008","volume":"86","author":"E Carrizosa","year":"2019","unstructured":"Carrizosa E, Guerrero V, Romero Morales D (2019) Visualization of complex dynamic datasets by means of mathematical optimization. Omega 86:125\u2013136","journal-title":"Omega"},{"issue":"5","key":"508_CR27","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1080\/00273171.2019.1677208","volume":"55","author":"E Carrizosa","year":"2020","unstructured":"Carrizosa E, Romero Morales V, Guerrero D, Satorra A (2020) Enhancing interpretability in factor analysis by means of mathematical optimization. Multivar Behav Res 55(5):748\u2013762","journal-title":"Multivar Behav Res"},{"issue":"1","key":"508_CR28","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s11750-021-00594-1","volume":"29","author":"E Carrizosa","year":"2021","unstructured":"Carrizosa E, Molero-R\u00edo C, Romero Morales D (2021) Mathematical optimization in classification and regression trees. TOP 29(1):5\u201333","journal-title":"TOP"},{"issue":"102543","key":"508_CR29","first-page":"1","volume":"107","author":"E Carrizosa","year":"2022","unstructured":"Carrizosa E, Kurishchenko K, Mar\u00edn A, Romero Morales D (2022) Interpreting clusters via prototype optimization. Omega 107(102543):1\u201313","journal-title":"Omega"},{"issue":"1","key":"508_CR30","first-page":"27","volume":"29","author":"A Ciampi","year":"2005","unstructured":"Ciampi A, Gonz\u00e1lez Marcos A, Castej\u00f3n Limas M (2005) Correspondence analysis and two-way clustering. SORT 29(1):27\u201342","journal-title":"SORT"},{"key":"508_CR31","first-page":"2859","volume":"16","author":"JP Cunningham","year":"2015","unstructured":"Cunningham JP, Ghahramani Z (2015) Linear dimensionality reduction: Survey, insights, and generalizations. J Mach Learn Res 16:2859\u20132900","journal-title":"J Mach Learn Res"},{"key":"508_CR32","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/s10601-018-9285-6","volume":"23","author":"M Fischetti","year":"2018","unstructured":"Fischetti M, Jo J (2018) Deep neural networks and mixed integer linear optimization. Constraints 23:296\u2013309","journal-title":"Constraints"},{"issue":"5","key":"508_CR33","doi-asserted-by":"publisher","first-page":"1739","DOI":"10.1007\/s10994-022-06137-4","volume":"111","author":"S Fossier","year":"2022","unstructured":"Fossier S, Riverain P, Nadif M (2022) Semi-supervised latent block model with pairwise constraints. Mach Learn 111(5):1739\u20131764","journal-title":"Mach Learn"},{"issue":"6","key":"508_CR34","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1287\/opre.51.6.922.24914","volume":"51","author":"R Freling","year":"2003","unstructured":"Freling R, Romeijn HE, Romero Morales D, Wagelmans APM (2003) A branch-and-price algorithm for the multiperiod single-sourcing problem. Oper Res 51(6):922\u2013939","journal-title":"Oper Res"},{"issue":"3","key":"508_CR35","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 (2021) Optimization problems for machine learning: A survey. Eur J Oper Res 290(3):807\u2013828","journal-title":"Eur J Oper Res"},{"issue":"3","key":"508_CR36","first-page":"50","volume":"38","author":"B Goodman","year":"2017","unstructured":"Goodman B, Flaxman S (2017) European Union regulations on algorithmic decision-making and a \u201cright to explanation\u2019\u2019. AI Mag 38(3):50\u201357","journal-title":"AI Mag"},{"key":"508_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9995-0","volume-title":"Measures Of Association For Cross Classifications","author":"LA Goodman","year":"1979","unstructured":"Goodman LA, Kruskal WH (1979) Measures Of Association For Cross Classifications. Springer, New York"},{"issue":"4","key":"508_CR38","first-page":"437","volume":"24","author":"G Govaert","year":"1995","unstructured":"Govaert G (1995) Simultaneous clustering of rows and columns. Control Cybern 24(4):437\u2013458","journal-title":"Control Cybern"},{"issue":"3","key":"508_CR39","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1016\/j.ejor.2005.10.074","volume":"183","author":"G Govaert","year":"2007","unstructured":"Govaert G, Nadif M (2007) Clustering of contingency table and mixture model. Eur J Oper Res 183(3):1055\u20131066","journal-title":"Eur J Oper Res"},{"issue":"3","key":"508_CR40","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1080\/03610920903140197","volume":"39","author":"G Govaert","year":"2010","unstructured":"Govaert G, Nadif M (2010) Latent block model for contingency table. Comnun Stat Theor Meth 39(3):416\u2013425","journal-title":"Comnun Stat Theor Meth"},{"key":"508_CR41","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s11634-016-0274-6","volume":"12","author":"G Govaert","year":"2018","unstructured":"Govaert G, Nadif M (2018) Mutual information, phi-squared and model-based co-clustering for contingency tables. Adv Data Anal Classif 12:455\u2013488","journal-title":"Adv Data Anal Classif"},{"key":"508_CR42","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01901670","volume":"5","author":"MJ Greenacre","year":"1988","unstructured":"Greenacre MJ (1988) Clustering the rows and columns of a contingency table. J Classif 5:39\u201351","journal-title":"J Classif"},{"key":"508_CR43","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02614317","volume":"79","author":"P Hansen","year":"1997","unstructured":"Hansen P, Jaumard B (1997) Cluster analysis and mathematical programming. Math Program 79:191\u2013215","journal-title":"Math Program"},{"issue":"6","key":"508_CR44","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1287\/opre.2018.1741","volume":"66","author":"DS Hochbaum","year":"2018","unstructured":"Hochbaum DS, Liu S (2018) Adjacency-clustering and its application for yield prediction in integrated circuit manufacturing. Oper Res 66(6):1571\u20131585","journal-title":"Oper Res"},{"issue":"405","key":"508_CR45","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/01621459.1989.10478751","volume":"84","author":"H Joe","year":"1989","unstructured":"Joe H (1989) Relative entropy measures of multivariate dependence. J Am Stat Assoc 84(405):157\u2013164","journal-title":"J Am Stat Assoc"},{"issue":"7471","key":"508_CR46","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1038\/nature12634","volume":"502","author":"C Kandoth","year":"2013","unstructured":"Kandoth C, McLellan MD, Vandin F, Ye K, Niu B, Lu C, Xie M, Zhang Q, McMichael JF, Wyczalkowski MA, Leiserson MDM, Miller CA, Welch JS, Walter MJ, Wendl MC, Ley TJ, Wilson RK, Raphael BJ, Ding L (2013) Mutational landscape and significance across 12 major cancer types. Nature 502(7471):333\u2013352","journal-title":"Nature"},{"key":"508_CR47","unstructured":"Kerber R (1992) Chimerge: Discretization of numeric attributes. In: Proceedings of the 10th National Conference on Artificial intelligence, pp 123\u2013128"},{"key":"508_CR48","doi-asserted-by":"crossref","unstructured":"Labiod L, Nadif M (2011) Co-clustering for binary and categorical data with maximum modularity. In: IEEE 11th International conference on Data Mining, IEEE, pp 1140\u20131145","DOI":"10.1109\/ICDM.2011.37"},{"issue":"2","key":"508_CR49","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1198\/000313001750358428","volume":"55","author":"B Mirkin","year":"2001","unstructured":"Mirkin B (2001) Eleven ways to look at the chi-squared coefficient for contingency tables. Am Stat 55(2):111\u2013120","journal-title":"Am Stat"},{"issue":"11","key":"508_CR50","doi-asserted-by":"publisher","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 (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"3","key":"508_CR51","doi-asserted-by":"publisher","first-page":"1429","DOI":"10.1016\/j.ejor.2006.09.023","volume":"187","author":"S Olafsson","year":"2008","unstructured":"Olafsson S, Li X, Wu S (2008) Operations research and data mining. Eur J Oper Res 187(3):1429\u20131448","journal-title":"Eur J Oper Res"},{"issue":"3","key":"508_CR52","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/mnsc.46.3.363.12066","volume":"46","author":"K Park","year":"2000","unstructured":"Park K, Lee K, Park S, Lee H (2000) Telecommunication node clustering with node compatibility and network survivability requirements. Manage Sci 46(3):363\u2013374","journal-title":"Manage Sci"},{"issue":"302","key":"508_CR53","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/14786440009463897","volume":"50","author":"K Pearson","year":"1900","unstructured":"Pearson K (1900) On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 50(302):157\u2013175","journal-title":"The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science"},{"key":"508_CR54","doi-asserted-by":"crossref","unstructured":"Pisinger D, Ropke S (2010) Large neighborhood search. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics, vol 146, chapter 13, Springer, US, pp 399\u2013419","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"508_CR55","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.csda.2013.05.013","volume":"71","author":"S Pledger","year":"2014","unstructured":"Pledger S, Arnold R (2014) Multivariate methods using mixtures: correspondence analysis, scaling and pattern-detection. Comput Stat Data Anal 71:241\u2013261","journal-title":"Comput Stat Data Anal"},{"issue":"3","key":"508_CR56","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.ejor.2005.04.048","volume":"173","author":"B Sa\u011flam","year":"2006","unstructured":"Sa\u011flam B, Salman FS, Say\u0131n S, T\u00fcrkay M (2006) A mixed-integer programming approach to the clustering problem with an application in customer segmentation. Eur J Oper Res 173(3):866\u2013879","journal-title":"Eur J Oper Res"},{"issue":"4","key":"508_CR57","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1111\/poms.12819","volume":"27","author":"G Shmueli","year":"2017","unstructured":"Shmueli G, Yahav I (2017) The forest or the trees? Tackling Simpson\u2019s paradox with classification trees. Prod Oper Manag 27(4):696\u2013716","journal-title":"Prod Oper Manag"},{"issue":"3","key":"508_CR58","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s11634-016-0254-x","volume":"11","author":"M \u015amieja","year":"2017","unstructured":"\u015amieja M, Wiercioch M (2017) Constrained clustering with a complex cluster structure. Adv Data Anal Classif 11(3):493\u2013518","journal-title":"Adv Data Anal Classif"},{"issue":"1","key":"508_CR59","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2011.12.030","volume":"219","author":"A Toriello","year":"2012","unstructured":"Toriello A, Vielma JP (2012) Fitting piecewise linear continuous functions. Eur J Oper Res 219(1):86\u201395","journal-title":"Eur J Oper Res"},{"issue":"11","key":"508_CR60","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.ins.2008.11.023","volume":"179","author":"S Tsumoto","year":"2009","unstructured":"Tsumoto S (2009) Contingency matrix theory: statistical dependence in a contingency table. Inf Sci 179(11):1615\u20131627","journal-title":"Inf Sci"},{"issue":"3","key":"508_CR61","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10994-015-5528-6","volume":"102","author":"B Ustun","year":"2016","unstructured":"Ustun B, Rudin C (2016) Supersparse linear integer models for optimized medical scoring systems. Mach Learn 102(3):349\u2013391","journal-title":"Mach Learn"},{"key":"508_CR62","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1016\/j.ejor.2019.11.014","volume":"283","author":"M van de Velden","year":"2020","unstructured":"van de Velden M, van den Heuvel W, Galy H, Groenen PJF (2020) Retrieving a contingency table from a correspondence analysis solution. Eur J Oper Res 283:541\u2013548","journal-title":"Eur J Oper Res"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-022-00508-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11634-022-00508-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-022-00508-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T13:28:24Z","timestamp":1684330104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11634-022-00508-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,28]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["508"],"URL":"https:\/\/doi.org\/10.1007\/s11634-022-00508-4","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"type":"print","value":"1862-5347"},{"type":"electronic","value":"1862-5355"}],"subject":[],"published":{"date-parts":[[2022,6,28]]},"assertion":[{"value":"13 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}