2000 character limit reached
Multiclass MinMax Rank Aggregation (1701.08305v1)
Published 28 Jan 2017 in cs.LG, cs.AI, q-bio.QM, and stat.ML
Abstract: We introduce a new family of minmax rank aggregation problems under two distance measures, the Kendall {\tau} 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.