Interactive regret minimization

We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to have features of both skyline and top-k: it does not need information from the user but still controls the output size. While this approach is suitable for obtaining a reasonably small regret ratio, it is still open whether one can make the regret ratio arbitrarily small. Moreover, it remains open whether reasonable questions can be asked to the users in order to improve efficiency of the process. In this paper, we study the problem of minimizing regret ratio when the system is enhanced with interaction. We assume that when presented with a set of tuples the user can tell which tuple is most preferred. Under this assumption, we develop the problem of interactive regret minimization where we fix the number of questions and tuples per question that we can display, and aim at minimizing the regret ratio. We try ...

• Type: Journal
• Year: 2012
• Where: SIGMOD
• Authors: Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, Kazuhisa Makino
• Keywords: Criteria Decision, Database, Lower Bound, Orders Of Magnitude, SIGMOD 2012