Robust Reductions from Ranking to Classification

DOI10.1007/978-3-540-72927-3_43zbMath1203.68135OpenAlexW1660600014MaRDI QIDQ5434078

Don Coppersmith, Maria-Florina Balcan, Nikhil Bansal, Alina Beygelzimer, Gregory B. Sorkin, John Langford

Publication date: 3 January 2008

Published in: Learning Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72927-3_43

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (5)

Reduction from Cost-Sensitive Ordinal Ranking to Weighted Binary Classification ⋮ The \(K\)-armed dueling bandits problem ⋮ Preference-based learning to rank ⋮ Generic subset ranking using binary classifiers ⋮ Consistency of the estimator of binary response models based on AUC maximization

This page was built for publication: Robust Reductions from Ranking to Classification