A Fully Dynamic Algorithm for k-Regret Minimizing Sets

05/29/2020
by   Yanhao Wang, et al.
0

Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation. The k-regret minimizing set (k-RMS) problem was recently proposed for representative tuple discovery. Specifically, for a large database P of tuples with multiple numerical attributes, the k-RMS problem returns a size-r subset Q of P such that, for any possible ranking function, the score of the top-ranked tuple in Q is not much worse than the score of the kth-ranked tuple in P. Although the k-RMS problem has been extensively studied in the literature, existing methods are designed for the static setting and cannot maintain the result efficiently when the database is updated. To address this issue, we propose the first fully-dynamic algorithm for the k-RMS problem that can efficiently provide the up-to-date result w.r.t. any insertion and deletion in the database with a provable guarantee. Experimental results on several real-world and synthetic datasets demonstrate that our algorithm runs up to four orders of magnitude faster than existing k-RMS algorithms while returning results of nearly equal quality.

READ FULL TEXT

page 2

page 3

page 4

page 5

page 6

page 7

page 11

page 12

research
07/19/2020

GRMR: Generalized Regret-Minimizing Representatives

Extracting a small subset of representative tuples from a large database...
research
11/16/2021

Rank-Regret Minimization

Multi-criteria decision-making often requires finding a small representa...
research
02/06/2021

Approximating Happiness Maximizing Set Problems

A Happiness Maximizing Set (HMS) is a useful concept in which a smaller ...
research
02/28/2018

RRR: Rank-Regret Representative

We propose the rank-regret representative as a way of choosing a small s...
research
03/11/2021

Stochastic Package Queries in Probabilistic Databases

We provide methods for in-database support of decision making under unce...
research
03/27/2022

Budget-Constrained Reinforcement of Ranked Objects

Commercial entries, such as hotels, are ranked according to score by a s...
research
05/17/2018

Practical Algorithms for STV and Ranked Pairs with Parallel Universes Tiebreaking

STV and ranked pairs (RP) are two well-studied voting rules for group de...

Please sign up or login with your details

Forgot password? Click here to reset