Robust reductions from ranking to classification
From MaRDI portal
Recommendations
- Robust Reductions from Ranking to Classification
- Approximate reduction from AUC maximization to 1-norm soft margin optimization
- Generic subset ranking using binary classifiers
- Reduction from cost-sensitive ordinal ranking to weighted binary classification
- Generalization bounds for the area under the ROC curve
Cites work
- scientific article; zbMATH DE number 1288298 (Why is no real title available?)
- 10.1162/1532443041827916
- Generalization bounds for the area under the ROC curve
- Inequalities: theory of majorization and its applications
- Learning Theory
- Learning Theory
- Learning Theory
- Ordering by weighted number of wins gives a good ranking for weighted tournaments
- Ranking Tournaments
Cited in
(11)- Error-correcting tournaments
- Preference-based learning to rank
- Robust Reductions from Ranking to Classification
- On equivalence relationships between classification and ranking algorithms
- Approximate reduction from AUC maximization to 1-norm soft margin optimization
- Generalization bounds for the area under the ROC curve
- Reduction from cost-sensitive ordinal ranking to weighted binary classification
- Generic subset ranking using binary classifiers
- A review on instance ranking problems in statistical learning
- Quicksort leave-pair-out cross-validation for ROC curve analysis
- Reduced-rank multi-label classification
This page was built for publication: Robust reductions from ranking to classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009271)
