Computing optimal k-regret minimizing sets with top-k depth contours

Sean Chester, Alex Thomo, S. Venkatesh +1

Regret minimizing sets are a very recent approach to representing a dataset D with a small subset S of representative tuples. The set S is chosen such that executing any top-1 quer…