The TreeRank Tournament algorithm for multipartite ranking
From MaRDI portal
Publication:5256280
DOI10.1080/10485252.2014.967770zbMath1328.62261OpenAlexW2045434623MaRDI QIDQ5256280
Sylvain Robbiano, Stéphan Clémençon
Publication date: 22 June 2015
Published in: Journal of Nonparametric Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10485252.2014.967770
Related Items (3)
A review on instance ranking problems in statistical learning ⋮ On the variable bandwidth kernel estimation of conditional \(U\)-statistics at optimal rates in sup-norm ⋮ Concentration inequalities for two-sample rank processes with application to bipartite ranking
Cites Work
- Ranking data with ordinal labels: optimality and pairwise aggregation
- Adaptive partitioning schemes for bipartite ranking
- Overlaying classifiers: A practical approach to optimal scoring
- Label ranking by learning pairwise preferences
- Ranking and empirical minimization of \(U\)-statistics
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
- Multiple-event forced-choice tasks in the theory of signal detectability
- Tree-Based Ranking Methods
- Random forests
This page was built for publication: The TreeRank Tournament algorithm for multipartite ranking
