{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T17:48:51Z","timestamp":1786211331775,"version":"3.56.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T00:00:00Z","timestamp":1755475200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T00:00:00Z","timestamp":1755475200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009244","name":"Stockholm University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009244","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>CounterFair is a group counterfactual search algorithm that detects and minimizes biases among sensitive groups and identifies relevant subgroups inside these sensitive groups based on shared counterfactual instances. We investigate the latter capability, analyzing the found subgroups from the perspective of fairness based on counterfactual reasoning, in order to evaluate whether they present different biases with respect to each other and to the sensitive feature groups they belong to. We perform these measurements on the subgroups extracted by CounterFair over six binary classification datasets, providing figures and their respective analysis on the presence of bias.<\/jats:p>","DOI":"10.1007\/s10115-025-02555-7","type":"journal-article","created":{"date-parts":[[2025,8,18]],"date-time":"2025-08-18T03:12:56Z","timestamp":1755486776000},"page":"10863-10901","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Subgroup fairness based on shared counterfactuals"],"prefix":"10.1007","volume":"67","author":[{"given":"Alejandro","family":"Kuratomi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zed","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panayiotis","family":"Tsaparas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evaggelia","family":"Pitoura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tony","family":"Lindgren","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guilherme","family":"Dinis\u00a0Junior","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panagiotis","family":"Papapetrou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,18]]},"reference":[{"key":"2555_CR1","doi-asserted-by":"crossref","unstructured":"Guidotti R (2022) Counterfactual explanations and how to find them: literature review and benchmarking. Data Min Knowl Discov:1\u201355","DOI":"10.1007\/s10618-022-00831-6"},{"key":"2555_CR2","unstructured":"Karimi A-H, Barthe G, Balle B, Valera I (2020) Model-agnostic counterfactual explanations for consequential decisions. In: International conference on artificial intelligence and statistics. PMLR, pp 895\u2013905"},{"key":"2555_CR3","unstructured":"Molnar C (2021) Interpretable machine learning: a guide for making black-box models explainable. https:\/\/christophm.github.io\/interpretable-ml-book\/limo.html"},{"issue":"5","key":"2555_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3527848","volume":"55","author":"A-H Karimi","year":"2022","unstructured":"Karimi A-H, Barthe G, Sch\u00f6lkopf B, Valera I (2022) A survey of algorithmic recourse: contrastive explanations and consequential recommendations. ACM Comput Surv 55(5):1\u201329","journal-title":"ACM Comput Surv"},{"key":"2555_CR5","doi-asserted-by":"publisher","unstructured":"Sharma S, Henderson J, Ghosh J (2020) CERTIFAI: counterfactual explanations for robustness, transparency, interpretability, and fairness of artificial intelligence models. In: Proceedings of the AAAI\/ACM conference on AI, ethics, and society, pp 166\u2013172. https:\/\/doi.org\/10.1145\/3375627.3375812 . arXiv: 1905.07857. Accessed 05 March 2022","DOI":"10.1145\/3375627.3375812"},{"key":"2555_CR6","doi-asserted-by":"crossref","unstructured":"Kuratomi A, Pitoura E, Papapetrou P, Lindgren T, Tsaparas P (2022) Measuring the burden of (un) fairness using counterfactuals. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 402\u2013417","DOI":"10.1007\/978-3-031-23618-1_27"},{"key":"2555_CR7","first-page":"58246","volume":"36","author":"L Kavouras","year":"2024","unstructured":"Kavouras L, Tsopelas K, Giannopoulos G, Sacharidis D, Psaroudaki E, Theologitis N, Rontogiannis D, Fotakis D, Emiris I (2024) Fairness aware counterfactuals for subgroups. Adv Neural Inf Process Syst 36:58246","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"2555_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.ejor.2024.01.002","volume":"319","author":"E Carrizosa","year":"2024","unstructured":"Carrizosa E, Ram\u00edrez-Ayerbe J, Morales DR (2024) Mathematical optimization modelling for group counterfactual explanations. Eur J Oper Res 319(2):399\u2013412","journal-title":"Eur J Oper Res"},{"key":"2555_CR9","first-page":"1","volume":"30","author":"MJ Kusner","year":"2017","unstructured":"Kusner MJ, Loftus J, Russell C, Silva R (2017) Counterfactual fairness. Adv Neural Inf Process Syst 30:1\u201311","journal-title":"Adv Neural Inf Process Syst"},{"key":"2555_CR10","first-page":"12187","volume":"33","author":"K Rawal","year":"2020","unstructured":"Rawal K, Lakkaraju H (2020) Beyond individualized recourse: Interpretable and interactive summaries of actionable recourses. Adv Neural Inf Process Syst 33:12187\u201312198","journal-title":"Adv Neural Inf Process Syst"},{"key":"2555_CR11","doi-asserted-by":"crossref","unstructured":"Kuratomi A, Lee Z, Chaliane\u00a0Junior GD, Lindgren T, Papapetrou P, Pitoura E, Tsaparas P (2024) CounterFair: Group counterfactuals for bias detection, mitigation and subgroup identification. In: IEEE international conference on data mining (ICDM)","DOI":"10.1109\/ICDM59182.2024.00025"},{"key":"2555_CR12","unstructured":"Spangher A, Ustun B, Liu Y (2018) Actionable recourse in linear classification. In: Proceedings of the 5th workshop on fairness, accountability and transparency in machine learning"},{"issue":"4","key":"2555_CR13","first-page":"1","volume":"42","author":"X Wang","year":"2024","unstructured":"Wang X, Li Q, Yu D, Li Q, Xu G (2024) Counterfactual explanation for fairness in recommendation. ACM Trans Inf Syst 42(4):1\u201330","journal-title":"ACM Trans Inf Syst"},{"key":"2555_CR14","doi-asserted-by":"crossref","unstructured":"Pawelczyk M, Broelemann K, Kasneci G (2020) Learning model-agnostic counterfactual explanations for tabular data. In: Proceedings of the web conference 2020, pp 3126\u20133132","DOI":"10.1145\/3366423.3380087"},{"key":"2555_CR15","doi-asserted-by":"crossref","unstructured":"Mothilal RK, Sharma A, Tan C (2020) Explaining machine learning classifiers through diverse counterfactual explanations. In: Proceedings of the 2020 conference on fairness, accountability, and transparency, pp 607\u2013617","DOI":"10.1145\/3351095.3372850"},{"issue":"1","key":"2555_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2003.11.032","volume":"165","author":"CS ReVelle","year":"2005","unstructured":"ReVelle CS, Eiselt HA (2005) Location analysis: a synthesis and survey. Eur J Oper Res 165(1):1\u201319","journal-title":"Eur J Oper Res"},{"key":"2555_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-005-0700-6","volume":"109","author":"P Avella","year":"2007","unstructured":"Avella P, Sassano A, Vasil\u2019ev I (2007) Computational study of large-scale p-median problems. Math Program 109:89\u2013114","journal-title":"Math Program"},{"key":"2555_CR18","unstructured":"Verma S, Dickerson J, Hines K (2020) Counterfactual explanations for machine learning: a review. arXiv:2010.10596 [cs, stat]. arXiv: 2010.10596. Accessed 05 March 2022"},{"key":"2555_CR19","doi-asserted-by":"publisher","unstructured":"Coston A, Mishler A, Kennedy EH, Chouldechova A (2020) Counterfactual risk assessments, evaluation, and fairness. In: Proceedings of the 2020 conference on fairness, accountability, and transparency. ACM, Barcelona, Spain, pp 582\u2013593. https:\/\/doi.org\/10.1145\/3351095.3372851. Accessed 05 March 2022","DOI":"10.1145\/3351095.3372851"},{"issue":"4","key":"2555_CR20","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra HW Jr (1983) Integer programming with a fixed number of variables. Math Oper Res 8(4):538\u2013548","journal-title":"Math Oper Res"},{"key":"2555_CR21","doi-asserted-by":"crossref","unstructured":"Kannan R, Monma CL (1978) On the computational complexity of integer programming problems. In: Optimization and operations research, pp 161\u2013172. Chap. 17","DOI":"10.1007\/978-3-642-95322-4_17"},{"issue":"4","key":"2555_CR22","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou CH (1981) On the complexity of integer programming. J ACM (JACM) 28(4):765\u2013768","journal-title":"J ACM (JACM)"},{"issue":"1","key":"2555_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3424305","volume":"68","author":"MB Cohen","year":"2021","unstructured":"Cohen MB, Lee YT, Song Z (2021) Solving linear programs in the current matrix multiplication time. J ACM (JACM) 68(1):1\u201339","journal-title":"J ACM (JACM)"},{"key":"2555_CR24","first-page":"1","volume":"198","author":"A Basu","year":"2022","unstructured":"Basu A, Conforti M, Di Summa M, Jiang H (2022) Complexity of branch-and-bound and cutting planes in mixed-integer optimization. Math Program 198:1\u201324","journal-title":"Math Program"},{"issue":"3","key":"2555_CR25","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1002\/widm.1452","volume":"12","author":"T Le Quy","year":"2022","unstructured":"Le Quy T, Roy A, Iosifidis V, Zhang W, Ntoutsi E (2022) A survey on datasets for fairness-aware machine learning. Wiley Interdiscip Rev Data Min Knowl Discov 12(3):1452","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02555-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02555-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02555-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T15:52:12Z","timestamp":1762530732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02555-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,18]]},"references-count":25,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2555"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02555-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,18]]},"assertion":[{"value":"30 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2025","order":4,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}