Tree-Based Ranking Methods
From MaRDI portal
Publication:4974000
DOI10.1109/TIT.2009.2025558zbMath1367.62047MaRDI QIDQ4974000
Nicolas Vayatis, Stéphan Clémençon
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Stochastic approximation (62L20) Statistical ranking and selection procedures (62F07) Approximation by arbitrary linear expressions (41A45)
Related Items (10)
Applications of concentration inequalities for statistical scoring and ranking problems ⋮ PAC-Bayesian high dimensional bipartite ranking ⋮ Calibrating sufficiently ⋮ Ranking data with ordinal labels: optimality and pairwise aggregation ⋮ Overlaying classifiers: A practical approach to optimal scoring ⋮ Adaptive partitioning schemes for bipartite ranking ⋮ Upper bounds and aggregation in bipartite ranking ⋮ An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods ⋮ Concentration inequalities for two-sample rank processes with application to bipartite ranking ⋮ The TreeRank Tournament algorithm for multipartite ranking
This page was built for publication: Tree-Based Ranking Methods
