2000 character limit reached
Multiclass MinMax Rank Aggregation
Published 28 Jan 2017 in cs.LG, cs.AI, q-bio.QM, and stat.ML | (1701.08305v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.