Overlaying classifiers: A practical approach to optimal scoring
From MaRDI portal
Publication:607486
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
Cites work
- scientific article; zbMATH DE number 477682 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- scientific article; zbMATH DE number 3320868 (Why is no real title available?)
- 10.1162/1532443041827916
- A Neyman–Pearson Approach to Statistical Learning
- Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
- Considering cost asymmetry in learning classifiers
- Fast learning rates for plug-in classifiers
- Generalization bounds for the area under the ROC curve
- Learning Theory
- Learning minimum volume sets
- Nonparametric Estimation of Regression Level Sets
- On nonparametric estimation of density level sets
- Optimal aggregation of classifiers in statistical learning.
- Optimal rates for plug-in estimators of density level sets
- Performance Measures for Neyman–Pearson Classification
- Ranking and empirical minimization of \(U\)-statistics
- Ranking the best instances
- Ranking with a P-Norm Push
- Theory of Classification: a Survey of Some Recent Advances
- Tree-Based Ranking Methods
- Uniform Central Limit Theorems
Cited in
(12)- Concentration inequalities for two-sample rank processes with application to bipartite ranking
- Adaptive estimation of the optimal ROC curve and a bipartite ranking algorithm
- On the optimal binary classifier with an application
- Ranking data with ordinal labels: optimality and pairwise aggregation
- The treerank tournament algorithm for multipartite ranking
- Upper bounds and aggregation in bipartite ranking
- Quantitative robustness of instance ranking problems
- A statistical view of clustering performance through the theory of \(U\)-processes
- Applications of concentration inequalities for statistical scoring and ranking problems
- A review on instance ranking problems in statistical learning
- Adaptive partitioning schemes for bipartite ranking
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
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)
