{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T23:08:47Z","timestamp":1778368127094,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032190956","type":"print"},{"value":"9783032190963","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-19096-3_20","type":"book-chapter","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T22:12:14Z","timestamp":1778364734000},"page":"311-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How Much Does Cluster Fairness Cost? A Counterfactual-Based Approach"],"prefix":"10.1007","author":[{"given":"Antonia","family":"Karra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Vardakas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evaggelia","family":"Pitoura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aristidis","family":"Likas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,1]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Abbasi, M., Bhaskara, A., Venkatasubramanian, S.: Fair clustering via equitable group representations. In: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, pp. 504\u2013514 (2021)","DOI":"10.1145\/3442188.3445913"},{"key":"20_CR2","unstructured":"Abraham, S.S., Sundaram, S.S., et\u00a0al.: Fairness in clustering with multiple sensitive attributes. arXiv preprint arXiv:1910.05113 (2019)"},{"key":"20_CR3","unstructured":"Ahmadi, S., Galhotra, S., Saha, B., Schwartz, R.: Fair correlation clustering. arXiv preprint arXiv:2002.03508 (2020)"},{"key":"20_CR4","unstructured":"Artelt, A., Hammer, B.: On the computation of counterfactual explanations\u2013a survey. arXiv preprint arXiv:1911.07749 (2019)"},{"key":"20_CR5","unstructured":"Bera, S., Chakrabarty, D., Flores, N., Negahbani, M.: Fair algorithms for clustering. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"130698","DOI":"10.1109\/ACCESS.2021.3114099","volume":"9","author":"A Chhabra","year":"2021","unstructured":"Chhabra, A., Masalkovait\u0117, K., Mohapatra, P.: An overview of fairness in clustering. IEEE Access 9, 130698\u2013130720 (2021)","journal-title":"IEEE Access"},{"key":"20_CR7","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. Adv. Neural Inf. Process. Syst. 30 (2017)"},{"key":"20_CR8","unstructured":"Fogliato, R., G\u2019Sell, M., Chouldechova, A.: Fair hierarchical clustering. In: Conference on Neural Information Processing Systems (2021)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Ghadiri, M., Samadi, S., Vempala, S.: Socially fair k-means clustering. In: Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency, pp. 438\u2013448 (2021)","DOI":"10.1145\/3442188.3445906"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Gkartzios, C., Pitoura, E., Tsaparas, P.: Fair network communities through group modularity. In: Proceedings of the ACM on Web Conference 2025, WWW 2025, pp. 506\u2013517. ACM (2025)","DOI":"10.1145\/3696410.3714625"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Guidotti, R.: Counterfactual explanations and how to find them: literature review and benchmarking. Data Min. Knowl. Disc. 1\u201355 (2022)","DOI":"10.1007\/s10618-022-00831-6"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Karra, A., Vardakas, G., Pitoura, E., Likas, A.: Generating counterfactual explanations for clustering models based on their equivalence to classification models. In: 21st IFIP International Conference on Artificial Intelligence Applications and Innovations, AIAI, vol.\u00a0755, pp. 85\u2013100. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-96239-4_7","DOI":"10.1007\/978-3-031-96239-4_7"},{"key":"20_CR13","unstructured":"Kleindessner, M., Samadi, S., Awasthi, P., Morgenstern, J.: Guarantees for spectral clustering with fairness constraints. In: International Conference on Machine Learning, pp. 3458\u20133467. PMLR (2019)"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Kuratomi, A., Pitoura, E., Papapetrou, P., Lindgren, T., Tsaparas, P.: Measuring the burden of (un)fairness using counterfactuals. In: ECML\/PKDD Workshops (1). Communications in Computer and Information Science, vol.\u00a01752, pp. 402\u2013417. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-23618-1_27","DOI":"10.1007\/978-3-031-23618-1_27"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Lucic, A., Oosterhuis, H., Haned, H., de\u00a0Rijke, M.: Focus: flexible optimizable counterfactual explanations for tree ensembles. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a036, pp. 5313\u20135322 (2022)","DOI":"10.1609\/aaai.v36i5.20468"},{"key":"20_CR16","unstructured":"Makarychev, Y., Vakilian, A.: Approximation algorithms for socially fair clustering. In: Conference on Learning Theory, pp. 3246\u20133264. PMLR (2021)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Mothilal, R.K., Sharma, A., Tan, C.: Explaining machine learning classifiers through diverse counterfactual explanations. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, pp. 607\u2013617 (2020)","DOI":"10.1145\/3351095.3372850"},{"key":"20_CR18","unstructured":"Schmidt, M., Schwiegelshohn, C., Sohler, C.: Fair coresets and streaming algorithms for fair k-means clustering. arXiv preprint arXiv:1812.10854 (2018)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Sharma, S., Henderson, J., Ghosh, J.: Certifai: counterfactual explanations for robustness, transparency, interpretability, and fairness of artificial intelligence models. arXiv preprint arXiv:1905.07857 (2019)","DOI":"10.1145\/3375627.3375812"},{"key":"20_CR20","unstructured":"Spagnol, A., Sokol, K., Barbiero, P., Langheinrich, M., Gjoreski, M.: Counterfactual explanations for clustering models. arXiv preprint arXiv:2409.12632 (2024)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Tolomei, G., Silvestri, F., Haines, A., Lalmas, M.: Interpretable predictions of tree-based ensembles via actionable feature tweaking. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 465\u2013474 (2017)","DOI":"10.1145\/3097983.3098039"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-030-86520-7_40","volume-title":"Machine Learning and Knowledge Discovery in Databases. Research Track","author":"A Van Looveren","year":"2021","unstructured":"Van Looveren, A., Klaise, J.: Interpretable counterfactual explanations guided by prototypes. In: Oliver, N., P\u00e9rez-Cruz, F., Kramer, S., Read, J., Lozano, J.A. (eds.) ECML PKDD 2021. LNCS (LNAI), vol. 12976, pp. 650\u2013665. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86520-7_40"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Vardakas, G., Karra, A., Pitoura, E., Likas, A.: Counterfactual explanations for k-means and gaussian clustering (2025). https:\/\/arxiv.org\/abs\/2501.10234","DOI":"10.1109\/ICTAI66417.2025.00143"},{"key":"20_CR24","first-page":"841","volume":"31","author":"S Wachter","year":"2017","unstructured":"Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: automated decisions and the GDPR. Harv. JL & Tech. 31, 841 (2017)","journal-title":"Harv. JL & Tech."}],"container-title":["Communications in Computer and Information Science","Machine Learning and Principles and Practice of Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-19096-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T22:12:18Z","timestamp":1778364738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-19096-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032190956","9783032190963"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-19096-3_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","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":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecmlpkdd.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}