scientific article; zbMATH DE number 6276230

zbMath1307.68065MaRDI QIDQ5405240

Nicolas Vayatis, Stéphan Clémençon, Marine Depecker

Publication date: 1 April 2014

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bootstrapbaggingrank aggregationmedian rankingbipartite rankingAUC criterionfeature randomizationclassification datanonparametric scoringROC optimizationtree-based ranking rules

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (9)

On the asymptotics of random forests ⋮ A review on instance ranking problems in statistical learning ⋮ A random forest guided tour ⋮ Quantitative robustness of instance ranking problems ⋮ An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods ⋮ Minimax optimal rates for Mondrian trees and forests ⋮ Classification trees with soft splits optimized for ranking ⋮ Consistency of random forests ⋮ Towards convergence rate analysis of random forests for classification

This page was built for publication: