Minimizing Average Regret Ratio in Database
Summary: Proposes ARR to select k representative points, basing satisfaction on utility distribution rather than max regret. Proves ARR is supermodular and enables approximation, yielding fixed-size, distribution-aware samples without user input, unlike k-regret. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sepanta Zeighami (Hong Kong University of Science and Technology)
- 2. Raymond Chi-Wing Wong (Hong Kong University of Science and Technology)
BibTeX Citation
@inproceedings{zeighami_sigmod16,
title = {{Minimizing Average Regret Ratio in Database}},
author = {Zeighami, Sepanta and Wong, Raymond Chi-Wing},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2914831},
url = {https://dl.acm.org/doi/10.1145/2882903.2914831},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,716 | RRR: Rank-Regret Representative | 2019 | SIGMOD | 5.6993087e-05 |
| 6,918 | A Unified Optimization Algorithm For Solving “Regret-Minimizing Representative” Problems | 2020 | VLDB | 5.6445155e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,087 | Regret-Minimizing Representative Databases | 2010 | VLDB | 0.00012097722 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,582 | Robust Best Point Selection under Unreliable User Feedback | 2024 | VLDB |
| 2 | 2,105 | Computing k-Regret Minimizing Sets | 2014 | VLDB |
| 3 | 6,716 | RRR: Rank-Regret Representative | 2019 | SIGMOD |
| 4 | 7,452 | Strongly Truthful Interactive Regret Minimization | 2019 | SIGMOD |
| 5 | 6,918 | A Unified Optimization Algorithm For Solving “Regret-Minimizing Representative” Problems | 2020 | VLDB |
| 6 | 4,831 | Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative | 2017 | SIGMOD |
| 7 | 5,786 | k-Regret Queries with Nonlinear Utilities | 2015 | VLDB |
| 8 | 5,068 | Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality | 2018 | SIGMOD |
| 9 | 2,545 | Interactive Regret Minimization | 2012 | SIGMOD |
| 10 | 1,087 | Regret-Minimizing Representative Databases | 2010 | VLDB |