Ranking data with ordinal labels: optimality and pairwise aggregation
From MaRDI portal
Publication:374178
DOI10.1007/S10994-012-5325-4zbMATH Open1273.68295OpenAlexW1991365037WikidataQ64853943 ScholiaQ64853943MaRDI QIDQ374178FDOQ374178
Authors: Stephan Clémençon, Sylvain Robbiano, 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
Recommendations
- Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
- The treerank tournament algorithm for multipartite ranking
- Strong and weak stability of \(k\)-partite ranking algorithms
- A transitivity analysis of bipartite rankings in pairwise multi-class classification
- Upper bounds and aggregation in bipartite ranking
median rankingordinal dataempirical risk minimizationvolume under the ROC surface\(K\)-partite rankingROC surface
Cites Work
- A simple generalisation of the area under the ROC curve for multiple class classification problems
- Title not available (Why is that?)
- Testing Statistical Hypotheses
- Ranking and empirical minimization of \(U\)-statistics
- Superconvergence of Finite Element Approximations for the Stokes Problem by Projection Methods
- Classification by pairwise coupling
- Reducing multiclass to binary: A unifying approach for margin classifiers
- Title not available (Why is that?)
- 10.1162/153244302320884605
- Optimal aggregation of classifiers in statistical learning.
- Title not available (Why is that?)
- 10.1162/1532443041827916
- Fast learning rates for plug-in classifiers
- Is an ordinal class structure useful in classifier learning?
- On the scalability of ordered multi-class ROC analysis
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Lamarckian genetic algorithms applied to the aggregation of preferences
- NP-hardness results for the aggregation of linear orders into median orders
- Multiple-event forced-choice tasks in the theory of signal detectability
- The complexity of computing medians of relations.
- Generalization Bounds for Some Ordinal Regression Algorithms
- Adaptive estimation of the optimal ROC curve and a bipartite ranking algorithm
- Adaptive partitioning schemes for bipartite ranking
- Tree-Based Ranking Methods
- Learning Theory
- Median linear orders: Heuristics and a branch and bound algorithm
- Volume under the ROC surface for multi-class problems.
- 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
Cited In (11)
- Applications of concentration inequalities for statistical scoring and ranking problems
- Asymptotic properties of conditional U -statistics using delta sequences
- Concentration inequalities for two-sample rank processes with application to bipartite ranking
- A transitivity analysis of bipartite rankings in pairwise multi-class classification
- A review on instance ranking problems in statistical learning
- 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
- Accentuating the rank positions in an agreement index with reference to a consensus order
- Optimal full ranking from pairwise comparisons
- The TreeRank Tournament algorithm for multipartite ranking
Uses Software
This page was built for publication: Ranking data with ordinal labels: optimality and pairwise aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q374178)
