Overlaying classifiers: A practical approach to optimal scoring
DOI10.1007/S00365-010-9084-9zbMATH Open1200.62063OpenAlexW2140418054MaRDI QIDQ607486FDOQ607486
Stephan Clémençon, Nicolas Vayatis
Publication date: 22 November 2010
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00365-010-9084-9
statistical learningpiecewise linear approximationsup-normROC curvebipartite rankingAUC criteriondensity level setminimum volume set estimationscoring function
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Computational learning theory (68Q32) Nonparametric inference (62G99) Spline approximation (41A15)
Cites Work
- On nonparametric estimation of density level sets
- Title not available (Why is that?)
- Optimal rates for plug-in estimators of density level sets
- Title not available (Why is that?)
- Uniform Central Limit Theorems
- Nonparametric Estimation of Regression Level Sets
- Title not available (Why is that?)
- Ranking and empirical minimization of \(U\)-statistics
- Optimal aggregation of classifiers in statistical learning.
- Title not available (Why is that?)
- 10.1162/1532443041827916
- Fast learning rates for plug-in classifiers
- Theory of Classification: a Survey of Some Recent Advances
- Tree-Based Ranking Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
- Learning Theory
- A Neyman–Pearson Approach to Statistical Learning
- Title not available (Why is that?)
- Performance Measures for Neyman–Pearson Classification
- Ranking with a P-Norm Push
Cited In (10)
- Applications of concentration inequalities for statistical scoring and ranking problems
- Concentration inequalities for two-sample rank processes with application to bipartite ranking
- A review on instance ranking problems in statistical learning
- Quantitative robustness of instance ranking problems
- Upper bounds and aggregation in bipartite ranking
- A statistical view of clustering performance through the theory of \(U\)-processes
- The TreeRank Tournament algorithm for multipartite ranking
- Ranking data with ordinal labels: optimality and pairwise aggregation
- Adaptive partitioning schemes for bipartite ranking
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
Recommendations
- Adaptive estimation of the optimal ROC curve and a bipartite ranking algorithm 👍 👎
- An extension of the receiver operating characteristic curve and AUC-optimal classification 👍 👎
- Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm 👍 👎
- Applications of concentration inequalities for statistical scoring and ranking problems 👍 👎
- On Feature Ensemble Optimizing the Sensitivity and Partial ROC Curve 👍 👎
This page was built for publication: Overlaying classifiers: A practical approach to optimal scoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607486)
