A Versatile Framework for Evaluating Ranked Lists in terms of Group Fairness and Relevance
Not on the map. Why?
Abstract (arXiv)
We present a simple and versatile framework for evaluating ranked lists in terms of group fairness and relevance, where the groups (i.e., possible attribute values) can be either nominal or ordinal in nature. First, we demonstrate that, if the attribute set is binary, our framework can easily quantify the overall polarity of each ranked list. Second, by utilising an existing diversified search test collection and treating each intent as an attribute value, we demonstrate that our framework can handle soft group membership, and that our group fairness measures are highly correlated with both adhoc IR and diversified IR measures under this setting. Third, we demonstrate how our framework can quantify intersectional group fairness based on multiple attribute sets. We also show that the similarity function for comparing the achieved and target distributions over the attribute values should be chosen carefully.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Apr 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 0; 2026: 1.
4 papers.
- 2024Measuring and Addressing Indexical Bias in Information Retrievalcited by 6
- 2023SWAN: A Generic Framework for Auditing Textual Conversational Systemscited by 4
- 2024Advancing Re-Ranking with Multimodal Fusion and Target-Oriented Auxiliary Tasks in E-Commerce Searchcited by 2
- 2026Plans for Evaluating Structured Generative Search Summariescited by 0
- 2026Plans for Evaluating Structured Generative Search Summaries26 May 2026
- 2024Advancing Re-Ranking with Multimodal Fusion and Target-Oriented Auxiliary Tasks in E-Commerce Search11 Aug 2024
- 2024Measuring and Addressing Indexical Bias in Information Retrieval6 Jun 2024
- 2023SWAN: A Generic Framework for Auditing Textual Conversational Systems15 May 2023