EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Intersectional fair ranking via subgroup divergence

Eliana Pastor, Francesco Bonchi

Data Mining and Knowledge Discovery · 2024-07 · 38 (4) · 2186-2222

DOI: 10.1007/s10618-024-01029-8 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Data Mining and Knowledge Discovery, online erschienen am 21.05.2024. Verfasst von Eliana Pastor und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 39 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Centre for HPC, Big Data and Quantum Computing, Politecnico di Torino.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Societal biases encoded in real-world data can contaminate algorithmic decisions, perpetuating preexisting inequalities in domains such as employment and education. In the fair ranking literature, following the doctrine of affirmative action, fairness is enforced by means of a group-fairness constraint requiring “enough” individuals from protected groups in the top-k positions, for a ranking to be considered valid. However, which are the groups that need to be protected? And how much representation is “enough”? As the biases affecting the process may not always be directly observable nor measurable, these questions might be hard to answer in a principled way, especially when many different potentially discriminated subgroups exist. This paper addresses this issue by automatically identifying the disadvantaged groups in the data and mitigating their disparate representation in the final ranking. Our proposal leverages the notion of divergence to automatically identify which subgroups, defined as combination of sensitive attributes, show a statistically significant deviation, in terms of ranking utility, compared to the overall population. Subgroups with negative divergence experience a disadvantage. We formulate the problem of re-ranking instances to maximize the minimum subgroup divergence, while maintaining the new ranking as close as possible to the original one. We develop a method which is based on identifying the divergent subgroups and applying a re-ranking procedure which is monotonic w.r.t. the goal of maximizing the minimum divergence. Our experimental results show that our method effectively eliminates the existence of disadvantaged subgroups while producing rankings which are very close to the original ones.

Förderung

  • National Centre for HPC, Big Data and Quantum Computing
  • Politecnico di Torino

Zitieren

APA

Pastor, E., & Bonchi, F. (2024). Intersectional fair ranking via subgroup divergence. Data Mining and Knowledge Discovery, 38(4), 2186-2222. https://doi.org/10.1007/s10618-024-01029-8

Vancouver

Pastor E, Bonchi F. Intersectional fair ranking via subgroup divergence. Data Mining and Knowledge Discovery. 2024;38(4):2186-2222. doi:10.1007/s10618-024-01029-8

BibTeX
@article{Pastor2024,
  author = {Pastor, Eliana and Bonchi, Francesco},
  title = {Intersectional fair ranking via subgroup divergence},
  journal = {Data Mining and Knowledge Discovery},
  year = {2024},
  volume = {38},
  number = {4},
  pages = {2186--2222},
  doi = {10.1007/s10618-024-01029-8}
}
Kostenlos starten →