The following pages link to Tree-Based Ranking Methods (Q4974000):
Displayed 10 items.
- Ranking data with ordinal labels: optimality and pairwise aggregation (Q374178) (← links)
- Adaptive partitioning schemes for bipartite ranking (Q413849) (← links)
- Overlaying classifiers: A practical approach to optimal scoring (Q607486) (← links)
- PAC-Bayesian high dimensional bipartite ranking (Q1642737) (← links)
- Upper bounds and aggregation in bipartite ranking (Q1951156) (← links)
- Concentration inequalities for two-sample rank processes with application to bipartite ranking (Q2233587) (← links)
- An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods (Q2444590) (← links)
- Applications of concentration inequalities for statistical scoring and ranking problems (Q3451708) (← links)
- Calibrating sufficiently (Q5085225) (← links)
- The TreeRank Tournament algorithm for multipartite ranking (Q5256280) (← links)