Multiclass MinMax Rank Aggregation

01/28/2017
by   Pan Li, et al.
0

We introduce a new family of minmax rank aggregation problems under two distance measures, the Kendall τ and the Spearman footrule. As the problems are NP-hard, we proceed to describe a number of constant-approximation algorithms for solving them. We conclude with illustrative applications of the aggregation methods on the Mallows model and genomic data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/07/2023

Parameterized Aspects of Distinct Kemeny Rank Aggregation

The Kemeny method is one of the popular tools for rank aggregation. Howe...
research
10/01/2018

Chasing Similarity: Distribution-aware Aggregation Scheduling (Extended Version)

Parallel aggregation is a ubiquitous operation in data analytics that is...
research
11/02/2022

An Aggregation of Aggregation Methods in Computational Pathology

Image analysis and machine learning algorithms operating on multi-gigapi...
research
06/02/2015

Performing Bayesian Risk Aggregation using Discrete Approximation Algorithms with Graph Factorization

Risk aggregation is a popular method used to estimate the sum of a colle...
research
06/14/2023

Measuring and Controlling Divisiveness in Rank Aggregation

In rank aggregation, members of a population rank issues to decide which...
research
05/29/2019

Fast and Robust Rank Aggregation against Model Misspecification

In rank aggregation, preferences from different users are summarized int...
research
04/22/2019

GLS and VNS Based Heuristics for Conflict-Free Minimum-Latency Aggregation Scheduling in WSN

We consider a conflict-free minimum latency data aggregation problem tha...

Please sign up or login with your details

Forgot password? Click here to reset