Adaptive partitioning schemes for bipartite ranking
From MaRDI portal
Publication:413849
DOI10.1007/s10994-010-5190-yzbMath1237.68141OpenAlexW1490774185MaRDI QIDQ413849
Marine Depecker, Stéphan Clémençon, Nicolas Vayatis
Publication date: 8 May 2012
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-010-5190-y
AUCpruningrecursive partitioningROC curveranking treesscoring algorithmssplitting rulesTreeRankvariable importance
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (6)
A review on instance ranking problems in statistical learning ⋮ PAC-Bayesian high dimensional bipartite ranking ⋮ Ranking data with ordinal labels: optimality and pairwise aggregation ⋮ An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods ⋮ Generalization performance of bipartite ranking algorithms with convex losses ⋮ The TreeRank Tournament algorithm for multipartite ranking
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Overlaying classifiers: A practical approach to optimal scoring
- Tree induction for probability-based ranking
- Optimal aggregation of classifiers in statistical learning.
- Model selection by resampling penalization
- A critical analysis of variants of the AUC
- Ranking and empirical minimization of \(U\)-statistics
- Approximation Theorems of Mathematical Statistics
- Theory of Classification: a Survey of Some Recent Advances
- Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
- Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm
- Analysis of a complexity-based pruning scheme for classification trees
- 10.1162/1532443041827916
- Concept learning using complexity regularization
- Tree-Based Ranking Methods
- Learning Theory
- Machine Learning: ECML 2003
This page was built for publication: Adaptive partitioning schemes for bipartite ranking
