Demo Data from VLDB 2026 / reviewers in the wild / expert
Abraham Gale
dblp:227/2954
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
2 papers |
Information retrieval · 100% | |
| Artificial intelligence
1 paper |
Trustworthy machine learning · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval › ranking › multi-objective ranking
fair ranking |
1.2 | 2 | 2024 | Explainable Disparity Compensation for Efficient Fair Ranking · ICDE 2024 Explaining Ranking Functions · Proc. VLDB Endow. 2020 |
Information retrieval
ranking |
1.2 | 2 | 2024 | Explainable Disparity Compensation for Efficient Fair Ranking · ICDE 2024 Explaining Ranking Functions · Proc. VLDB Endow. 2020 |
Machine learning › Trustworthy machine learning
fairness |
0.8 | 1 | 2024 | Explainable Disparity Compensation for Efficient Fair Ranking · ICDE 2024 |
Information retrieval › ranking › ranking model
interpretable ranking |
0.7 | 2 | 2024 | Explaining Ranking Functions · Proc. VLDB Endow. 2020 Explainable Disparity Compensation for Efficient Fair Ranking · ICDE 2024 |
Methods — techniques the papers use, named apart from their topics
sampling-based algorithm · 1.5bonus points · 1.5information theory · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Explainable Disparity Compensation for Efficient Fair RankingabstractRanking functions that are used in decision systems often produce disparate results for different populations because of bias in the underlying data. Addressing, and compensating for, these disparate outcomes is a critical problem for fair decision-making. Recent compensatory measures have mostly focused on opaque transformations of the ranking functions to satisfy fairness guarantees or on the use of quotas or set-asides to guarantee a minimum number of positive outcomes to members of underrepresented groups. In this paper we propose easily explainable data-driven compensatory measures for ranking functions. Our measures rely on the generation of bonus points given to members of underrepresented groups to address disparity in the ranking function. The bonus points can be set in advance, and can be combined, allowing for considering the intersections of representations and giving better transparency to stakeholders. We propose efficient sampling-based algorithms to calculate the number of bonus points to minimize disparity. We validate our algorithms using real-world school admissions and recidivism datasets, and compare our results with that of existing fair ranking algorithms. Abraham Gale, Amélie Marian |
ICDE | 1 |
| 2020 | Explaining Ranking FunctionsabstractRanking functions are commonly used to assist in decision-making in a wide variety of applications. As the general public realizes the significant societal impacts of the widespread use of algorithms in decision-making, there has been a push towards explainability and transparency in decision processes and results, as well as demands to justify the fairness of the processes. In this paper, we focus on providing metrics towards explainability and transparency of ranking functions, with a focus towards making the ranking process understandable, a priori , so that decision-makers can make informed choices when designing their ranking selection process. We propose transparent participation metrics to clarify the ranking process, by assessing the contribution of each parameter used in the ranking function in the creation of the final ranked outcome, using information about the ranking functions themselves, as well as observations of the underlying distributions of the parameter values involved in the ranking. To evaluate the outcome of the ranking process, we propose diversity and disparity metrics to measure how similar the selected objects are to each other, and to the underlying data distribution. We evaluate the behavior of our metrics on synthetic data, as well as on data and ranking functions on two real-world scenarios: high school admissions and decathlon scoring. Abraham Gale, Amélie Marian |
Proc. VLDB Endow. | 1 |