{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:32:19Z","timestamp":1743017539669,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031746260"},{"type":"electronic","value":"9783031746277"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-74627-7_37","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:00:44Z","timestamp":1735653644000},"page":"448-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FALE: Fairness-Aware ALE Plots for\u00a0Auditing Bias in\u00a0Subgroups"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8252-9869","authenticated-orcid":false,"given":"Giorgos","family":"Giannopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5022-1483","authenticated-orcid":false,"given":"Dimitris","family":"Sacharidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolas","family":"Theologitis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loukas","family":"Kavouras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2339-5303","authenticated-orcid":false,"given":"Ioannis","family":"Emiris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,1]]},"reference":[{"key":"37_CR1","unstructured":"Bache, K., Lichman, M.: UCI machine learning repository (2013). http:\/\/archive.ics.uci.edu\/ml"},{"key":"37_CR2","doi-asserted-by":"publisher","unstructured":"Black, E., Yeom, S., Fredrikson, M.: FlipTest: fairness testing via optimal transport. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, FAT* 2020, pp. 111\u2013121. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3351095.3372845","DOI":"10.1145\/3351095.3372845"},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.103224","volume":"60","author":"G Cornacchia","year":"2023","unstructured":"Cornacchia, G., et al.: Auditing fairness under unawareness through counterfactual reasoning. Inf. Process. Manag. 60(2), 103224 (2023)","journal-title":"Inf. Process. Manag."},{"key":"37_CR4","first-page":"1189","volume":"29","author":"JH Friedman","year":"2000","unstructured":"Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29, 1189\u20131232 (2000)","journal-title":"Ann. Stat."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Greenwell, B.M., Boehmke, B.C., McCarthy, A.J.: A simple and effective model-based variable importance measure (2018)","DOI":"10.32614\/CRAN.package.vip"},{"key":"37_CR6","unstructured":"Gr\u00f6mping, U.: Model-agnostic effects plots for interpreting machine learning models, March 2020"},{"key":"37_CR7","doi-asserted-by":"publisher","unstructured":"Hauer, M.P., Kevekordes, J., Haeri, M.A.: Legal perspective on possible fairness measures - a legal discussion using the example of hiring decisions. Comput. Law Secur. Rev. 42, 105583 (2021). https:\/\/doi.org\/10.1016\/j.clsr.2021.105583. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S026736492100056X","DOI":"10.1016\/j.clsr.2021.105583"},{"issue":"5","key":"37_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3527848","volume":"55","author":"AH Karimi","year":"2022","unstructured":"Karimi, A.H., Barthe, G., Sch\u00f6lkopf, B., Valera, I.: A survey of algorithmic recourse: contrastive explanations and consequential recommendations. ACM Comput. Surv. 55(5), 1\u201329 (2022)","journal-title":"ACM Comput. Surv."},{"key":"37_CR9","unstructured":"Karimi, A.H., Von K\u00fcgelgen, J., Sch\u00f6lkopf, B., Valera, I.: Algorithmic recourse under imperfect causal knowledge: a probabilistic approach. In: Advances in Neural Information Processing Systems, vol. 33, pp. 265\u2013277 (2020)"},{"key":"37_CR10","doi-asserted-by":"publisher","unstructured":"Kavouras, L., et al.: Fairness aware counterfactuals for subgroups (2023). https:\/\/doi.org\/10.48550\/arXiv.2306.14978","DOI":"10.48550\/arXiv.2306.14978"},{"key":"37_CR11","unstructured":"Kearns, M., Neel, S., Roth, A., Wu, Z.S.: Preventing fairness gerrymandering: auditing and learning for subgroup fairness. In: Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 2564\u20132572. PMLR, 10\u201315 July 2018. https:\/\/proceedings.mlr.press\/v80\/kearns18a.html"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Kearns, M., Neel, S., Roth, A., Wu, Z.S.: An empirical study of rich subgroup fairness for machine learning. In: Proceedings of the Conference on Fairness, Accountability, and Transparency, pp. 100\u2013109 (2019)","DOI":"10.1145\/3287560.3287592"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"von K\u00fcgelgen, J., Karimi, A., Bhatt, U., Valera, I., Weller, A., Sch\u00f6lkopf, B.: On the fairness of causal algorithmic recourse. In: AAAI, pp. 9584\u20139594. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i9.21192"},{"key":"37_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: Koprinska, I., et al. (eds.) ECML PKDD 2022, Part I. CCIS, vol. 1752, pp. 402\u2013417. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-23618-1_27","DOI":"10.1007\/978-3-031-23618-1_27"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Lakkaraju, H., Kamar, E., Caruana, R., Leskovec, J.: Faithful and customizable explanations of black box models. In: Proceedings of the 2019 AAAI\/ACM Conference on AI, Ethics, and Society, pp. 131\u2013138 (2019)","DOI":"10.1145\/3306618.3314229"},{"key":"37_CR16","unstructured":"Ley, D., Mishra, S., Magazzeni, D.: Global counterfactual explanations: investigations, implementations and improvements. arXiv preprint arXiv:2204.06917 (2022)"},{"key":"37_CR17","unstructured":"Rawal, K., Lakkaraju, H.: Beyond individualized recourse: interpretable and interactive summaries of actionable recourses. In: Advances in Neural Information Processing Systems, vol. 33, pp. 12187\u201312198 (2020)"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Sharma, S., Henderson, J., Ghosh, J.: CERTIFAI: a common framework to provide explanations and analyse the fairness and robustness of black-box models. In: AIES, pp. 166\u2013172. ACM (2020)","DOI":"10.1145\/3375627.3375812"},{"key":"37_CR19","unstructured":"Sundararajan, M., Najmi, A.: The many Shapley values for model explanation. In: III, H.D., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 119, pp. 9269\u20139278. PMLR, 13\u201318 July 2020. https:\/\/proceedings.mlr.press\/v119\/sundararajan20b.html"},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"Tramer, F., et al.: FairTest: discovering unwarranted associations in data-driven applications. In: 2017 IEEE European Symposium on Security and Privacy (EuroS &P), pp. 401\u2013416. IEEE (2017)","DOI":"10.1109\/EuroSP.2017.29"},{"key":"37_CR21","unstructured":"Tram\u00e8r, F., et al.: Discovering unwarranted associations in data-driven applications with the FairTest testing toolkit. arXiv:abs\/1510.02377 (2015)"},{"key":"37_CR22","doi-asserted-by":"publisher","unstructured":"Verma, S., Rubin, J.: Fairness definitions explained. In: Proceedings of the International Workshop on Software Fairness, FairWare 2018, pp. 1\u20137. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3194770.3194776","DOI":"10.1145\/3194770.3194776"},{"key":"37_CR23","doi-asserted-by":"publisher","unstructured":"Wachter, S., Mittelstadt, B., Russell, C.: Why fairness cannot be automated: bridging the gap between EU non-discrimination law and AI. Comput. Law Secur. Rev. 41, 105567 (2021). https:\/\/doi.org\/10.1016\/j.clsr.2021.105567. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0267364921000406","DOI":"10.1016\/j.clsr.2021.105567"}],"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-031-74627-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T14:15:55Z","timestamp":1735654555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74627-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031746260","9783031746277"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74627-7_37","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 January 2025","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":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}