Overlaying classifiers: A practical approach to optimal scoring
From MaRDI portal
Publication:607486
DOI10.1007/s00365-010-9084-9zbMath1200.62063OpenAlexW2140418054MaRDI QIDQ607486
Stéphan 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
sup-normROC curvepiecewise linear approximationscoring functionstatistical learningbipartite rankingAUC criteriondensity level setminimum volume set estimation
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational learning theory (68Q32) Applications of mathematical programming (90C90) Spline approximation (41A15) Nonparametric inference (62G99)
Related Items
A review on instance ranking problems in statistical learning ⋮ Applications of concentration inequalities for statistical scoring and ranking problems ⋮ Ranking data with ordinal labels: optimality and pairwise aggregation ⋮ A statistical view of clustering performance through the theory of \(U\)-processes ⋮ Adaptive partitioning schemes for bipartite ranking ⋮ Quantitative robustness of instance ranking problems ⋮ Upper bounds and aggregation in bipartite ranking ⋮ An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods ⋮ Concentration inequalities for two-sample rank processes with application to bipartite ranking ⋮ The TreeRank Tournament algorithm for multipartite ranking
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal rates for plug-in estimators of density level sets
- Fast learning rates for plug-in classifiers
- On nonparametric estimation of density level sets
- Optimal aggregation of classifiers in statistical learning.
- Ranking and empirical minimization of \(U\)-statistics
- Theory of Classification: a Survey of Some Recent Advances
- Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
- A Neyman–Pearson Approach to Statistical Learning
- Performance Measures for Neyman–Pearson Classification
- Uniform Central Limit Theorems
- Nonparametric Estimation of Regression Level Sets
- 10.1162/1532443041827916
- Tree-Based Ranking Methods
- Ranking with a P-Norm Push
- Learning Theory
