Ranking forests

MaRDI QIDQ5405240zbMATH OpenFDO

Authors Stephan Clémençon, Marine Depecker, Nicolas Vayatis

Publication date 1 April 2014

Full work available at URL http://www.jmlr.org/papers/v14/clemencon13a.html

zbMATH Keywords

AUC criterionbaggingbipartite rankingbootstrapclassification datafeature randomizationmedian rankingnonparametric scoringrank aggregationROC optimizationtree-based ranking rules

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Random forests
• Adaptive partitioning schemes for bipartite ranking
• An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
• Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
• Consistency of random forests

Cited in

(15)

• Classification trees with soft splits optimized for ranking
• Towards convergence rate analysis of random forests for classification
• A review on instance ranking problems in statistical learning
• Minimax optimal rates for Mondrian trees and forests
• An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods
• Consistency of random forests
• A random forest guided tour
• On the asymptotics of random forests
• Inductive Logic Programming
• Quantitative robustness of instance ranking problems
• Amicability of forests
• Analysis of ranking data
• Pure interaction effects unseen by Random Forests
• A bipartite ranking approach to the two-sample problem
• Learning to rank anomalies: scalar performance criteria and maximization of rank statistics

This page was built for publication: Ranking forests

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