Finding Average Regret Ratio Minimizing Set in Database

by   Sepanta Zeighami, et al.

Selecting a certain number of data points (or records) from a database which "best" satisfy users' expectations is a very prevalent problem with many applications. One application is a hotel booking website showing a certain number of hotels on a single page. However, this problem is very challenging since the selected points should "collectively" satisfy the expectation of all users. Showing a certain number of data points to a single user could decrease the satisfaction of a user because the user may not be able to see his/her favorite point which could be found in the original database. In this paper, we would like to find a set of k points such that on average, the satisfaction (ratio) of a user is maximized. This problem takes into account the probability distribution of the users and considers the satisfaction (ratio) of all users, which is more reasonable in practice, compared with the existing studies that only consider the worst-case satisfaction (ratio) of the users, which may not reflect the whole population and is not useful in some applications. Motivated by this, in this paper, we propose algorithms for this problem. Finally, we conducted experiments to show the effectiveness and the efficiency of the algorithms.


page 1

page 2

page 3

page 4


Approximating Happiness Maximizing Set Problems

A Happiness Maximizing Set (HMS) is a useful concept in which a smaller ...

Bus Frequency Optimization: When Waiting Time Matters in User Satisfaction

Reorganizing bus frequency to cater for the actual travel demand can sav...

A Case Study on Video Color Transfer: Exploring User Motivations, Expectations, and Satisfaction

Multimedia and creativity software products are being used to edit and c...

Approximation Ineffectiveness of a Tour-Untangling Heuristic

We analyze a tour-uncrossing heuristic for the Travelling Salesperson Pr...

Learning from Invalid Data: On Constraint Satisfaction in Generative Models

Generative models have demonstrated impressive results in vision, langua...

Generalized Metric Repair on Graphs

Many modern data analysis algorithms either assume that or are considera...

SURF: Improving classifiers in production by learning from busy and noisy end users

Supervised learning classifiers inevitably make mistakes in production, ...

Please sign up or login with your details

Forgot password? Click here to reset