Tree-Based Ranking Methods

DOI10.1109/TIT.2009.2025558MaRDI QIDQ4974000zbMATH OpenFDO

Authors Stephan Clémençon, Nicolas Vayatis

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2009.2025558

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Stochastic approximation (62L20) Approximation by arbitrary linear expressions (41A45)

Cited in

(13)

• Calibrating sufficiently
• A bipartite ranking approach to the two-sample problem
• Applications of concentration inequalities for statistical scoring and ranking problems
• The treerank tournament algorithm for multipartite ranking
• Concentration inequalities for two-sample rank processes with application to bipartite ranking
• Learning to rank anomalies: scalar performance criteria and maximization of rank statistics
• PAC-Bayesian high dimensional bipartite ranking
• Analysis of ranking data
• Upper bounds and aggregation in bipartite ranking
• Ranking data with ordinal labels: optimality and pairwise aggregation
• 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: Tree-Based Ranking Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974000)