Equitable Top-k Results for Long Tail Data
Summary: Equitable top-k for long-tail data via theta-Equiv-top-k-MMSP; formalizes two subproblems: theta-Equiv-top-k-Sets and MaxMinFair. Generates many utility-equivalent top-k sets and a MaxMinFair distribution to equalize exposure; presents exact and scalable methods (random-walk, greedy, adaptive) and validates on six datasets. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Md Mouinul Islam (New Jersey Institute of Technology)
- 2. Mahsa Asadi (New Jersey Institute of Technology)
- 3. Senjuti Basu Roy (New Jersey Institute of Technology)
BibTeX Citation
@inproceedings{islam_sigmod23,
title = {{Equitable Top-k Results for Long Tail Data}},
author = {Islam, Md Mouinul and Asadi, Mahsa and Roy, Senjuti Basu},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3626727},
url = {https://dl.acm.org/doi/10.1145/3626727},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,018 | Fairness in Preference Queries: Social Choice Theories Meet Data Management | 2024 | VLDB | 5.4061498e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010679641 |
| 1,379 | Designing Fair Ranking Schemes | 2019 | SIGMOD | 0.0001086418 |
| 1,476 | Diversifying Top-K Results | 2012 | VLDB | 0.00010551487 |
| 1,915 | Formal Models of Web Queries | 1997 | PODS | 9.3840448e-05 |
| 3,129 | MithraCoverage: A System for Investigating Population Bias for Intersectional Fairness | 2020 | SIGMOD | 7.6149779e-05 |
| 4,719 | OmniFair: A Declarative System for Model-Agnostic Group Fairness in Machine Learning | 2021 | SIGMOD | 6.4548076e-05 |
| 4,966 | Unsupervised Time Series Outlier Detection with Diversity-Driven Convolutional Ensembles | 2022 | VLDB | 6.3354746e-05 |
| 6,271 | Page Quality: In Search of an Unbiased Web Ranking | 2005 | SIGMOD | 5.828101e-05 |
| 7,588 | Rank Aggregation with Proportionate Fairness | 2022 | SIGMOD | 5.4886e-05 |
| 7,776 | Efficient Indexes for Diverse Top-k Range Queries | 2020 | PODS | 5.4546499e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,576 | Happiness Maximizing Sets under Group Fairness Constraints | 2023 | VLDB |
| 2 | 8,449 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 3 | 1,379 | Designing Fair Ranking Schemes | 2019 | SIGMOD |
| 4 | 1,535 | Top-k Query Evaluation with Probabilistic Guarantees | 2004 | VLDB |
| 5 | 4,356 | Challenging the Long Tail Recommendation | 2012 | VLDB |
| 6 | 3,690 | Fair Near Neighbor Search: Independent Range Sampling in High Dimensions | 2020 | PODS |
| 7 | 6,065 | k-Hit Query: Top-k Query with Probabilistic Utility Function | 2015 | SIGMOD |
| 8 | 7,327 | Anytime Measures for Top-k Algorithms | 2007 | VLDB |
| 9 | 7,588 | Rank Aggregation with Proportionate Fairness | 2022 | SIGMOD |
| 10 | 9,397 | Satisfying Complex Top-k Fairness Constraints by Preference Substitutions | 2023 | VLDB |