Ranking data with ordinal labels: optimality and pairwise aggregation
From MaRDI portal
Publication:374178
DOI10.1007/s10994-012-5325-4zbMath1273.68295OpenAlexW1991365037WikidataQ64853943 ScholiaQ64853943MaRDI QIDQ374178
Sylvain Robbiano, Stéphan Clémençon, Nicolas Vayatis
Publication date: 22 October 2013
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-012-5325-4
ordinal dataempirical risk minimizationmedian rankingvolume under the ROC surface\(K\)-partite rankingROC surface
Related Items (8)
A review on instance ranking problems in statistical learning ⋮ Applications of concentration inequalities for statistical scoring and ranking problems ⋮ On the variable bandwidth kernel estimation of conditional \(U\)-statistics at optimal rates in sup-norm ⋮ Quantitative robustness of instance ranking problems ⋮ Support Vector Algorithms for Optimizing the Partial Area under the ROC Curve ⋮ Concentration inequalities for two-sample rank processes with application to bipartite ranking ⋮ Accentuating the rank positions in an agreement index with reference to a consensus order ⋮ The TreeRank Tournament algorithm for multipartite ranking
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive partitioning schemes for bipartite ranking
- Median linear orders: Heuristics and a branch and bound algorithm
- Overlaying classifiers: A practical approach to optimal scoring
- On the ERA ranking representability of pairwise bipartite ranking functions
- Nonparametric and semiparametric estimation of the three way receiver operating characteristic surface
- Fast learning rates for plug-in classifiers
- On the scalability of ordered multi-class ROC analysis
- Is an ordinal class structure useful in classifier learning?
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Lamarckian genetic algorithms applied to the aggregation of preferences
- Classification by pairwise coupling
- Optimal aggregation of classifiers in statistical learning.
- NP-hardness results for the aggregation of linear orders into median orders
- Ranking and empirical minimization of \(U\)-statistics
- Multiple-event forced-choice tasks in the theory of signal detectability
- 10.1162/15324430152733133
- Generalization Bounds for Some Ordinal Regression Algorithms
- Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm
- 10.1162/153244302320884605
- Superconvergence of Finite Element Approximations for the Stokes Problem by Projection Methods
- 10.1162/1532443041827916
- Tree-Based Ranking Methods
- Testing Statistical Hypotheses
- Learning Theory
- Machine Learning: ECML 2003
- A simple generalisation of the area under the ROC curve for multiple class classification problems
This page was built for publication: Ranking data with ordinal labels: optimality and pairwise aggregation
