Robust reductions from ranking to classification

DOI10.1007/s10994-008-5058-6zbMath1470.68075OpenAlexW2102011767MaRDI QIDQ1009271

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

Publication date: 31 March 2009

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

Full work available at URL: https://doi.org/10.1007/s10994-008-5058-6

zbMATH Keywords

classificationrankingrobust reductions

Mathematics Subject Classification ID

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

Related Items (3)

A review on instance ranking problems in statistical learning ⋮ Quicksort leave-pair-out cross-validation for ROC curve analysis ⋮ Preference-based learning to rank

Cites Work

• Unnamed Item
• Unnamed Item
• 10.1162/1532443041827916
• Ranking Tournaments
• Learning Theory
• Learning Theory
• Learning Theory
• Ordering by weighted number of wins gives a good ranking for weighted tournaments
• Inequalities: theory of majorization and its applications

This page was built for publication: Robust reductions from ranking to classification