Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
From MaRDI portal
Publication:3529908
DOI10.1007/978-3-540-87987-9_7zbMATH Open1156.68523OpenAlexW1603852322MaRDI QIDQ3529908FDOQ3529908
Authors: Stephan Clémençon, Nicolas Vayatis 
Publication date: 14 October 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87987-9_7
Recommendations
- Adaptive estimation of the optimal ROC curve and a bipartite ranking algorithm
- Rank-based kernel estimation of the area under the ROC curve
- A solution for the most basic optimization problem associated with an ROC curve
- A Flexible Method for Estimating the ROC Curve
- ROC curves and near neighbours, a proposal of a new condensation algorithm
- scientific article; zbMATH DE number 6445233
- ROC curves in cost space
- A boosting method for maximization of the area under the ROC curve
Cited In (13)
- Ranking forests
- Adaptive estimation of the optimal ROC curve and a bipartite ranking algorithm
- The treerank tournament algorithm for multipartite ranking
- A review on instance ranking problems in statistical learning
- Analysis of \(k\)-partite ranking algorithm in area under the receiver operating characteristic curve criterion
- Ranking the best instances
- Quantitative robustness of instance ranking problems
- The ROC region of a regression tree
- A ranking algorithm based on decision tree
- Learning layered ranking functions with structured support vector machines
- Adaptive partitioning schemes for bipartite ranking
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
- Overlaying classifiers: A practical approach to optimal scoring
This page was built for publication: Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3529908)
