RRR: Rank-Regret Representative

02/28/2018
by   Abolfazl Asudeh, et al.
0

We propose the rank-regret representative as a way of choosing a small subset of the database guaranteed to contain at least one of the top-k of any linear ranking function. We provide the techniques for finding such set and conduct experiments on real datasets to confirm the efficiency and effectiveness of our proposal.

READ FULL TEXT

page 1

page 2

research
11/16/2021

Rank-Regret Minimization

Multi-criteria decision-making often requires finding a small representa...
research
07/19/2020

GRMR: Generalized Regret-Minimizing Representatives

Extracting a small subset of representative tuples from a large database...
research
05/29/2020

A Fully Dynamic Algorithm for k-Regret Minimizing Sets

Selecting a small set of representatives from a large database is import...
research
03/01/2019

Regret Minimisation in Multinomial Logit Bandits

We consider two regret minimisation problems over subsets of a finite gr...
research
01/24/2023

Gossiped and Quantized Online Multi-Kernel Learning

In instances of online kernel learning where little prior information is...
research
04/29/2018

On Obtaining Stable Rankings

We often have to rank items with multiple attributes in a dataset. A typ...
research
04/24/2020

Proving μ>1

Choosing the right selection rate is a long standing issue in evolutiona...

Please sign up or login with your details

Forgot password? Click here to reset