An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods

DOI10.1007/S10044-012-0299-1MaRDI QIDQ2444590zbMATH OpenOpenAlexFDO

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

Publication date 10 April 2014

Published in PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10044-012-0299-1

zbMATH Keywords

AUC maximizationfeature randomizationranking treesresamplingROC curvescoring rules

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• Adaptive partitioning schemes for bipartite ranking
• The treerank tournament algorithm for multipartite ranking
• Approximation of the Optimal ROC Curve and a Tree-Based Ranking Algorithm
• Ranking forests
• A ranking algorithm based on decision tree

Cites work

• 10.1162/1532443041827916
• Adaptive partitioning schemes for bipartite ranking
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Considering cost asymmetry in learning classifiers
• Convexity, Classification, and Risk Bounds
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 47282 (Why is no real title available?)
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• Overlaying classifiers: A practical approach to optimal scoring
• Partial AUC Estimation and Regression
• Preference-based learning to rank
• Ranking and empirical minimization of \(U\)-statistics
• Ranking forests
• Ranking the best instances
• Sparseness vs estimating conditional probabilities: some asymptotic results
• The p-norm push: a simple convex ranking algorithm that concentrates at the top of the list
• Theory of Classification: a Survey of Some Recent Advances
• Tree-Based Ranking Methods

Cited in

(11)

• Asymptotic linear expansion of regularized M-estimators
• A review on instance ranking problems in statistical learning
• A ranking algorithm based on decision tree
• scientific article; zbMATH DE number 1931855 (Why is no real title available?)
• The treerank tournament algorithm for multipartite ranking
• Ranking forests
• New rank learning algorithm
• Elicitability of Instance and Object Ranking
• Quantitative robustness of instance ranking problems
• Scaling up ROC-optimizing support vector machines
• A bipartite ranking approach to the two-sample problem

This page was built for publication: An empirical comparison of learning algorithms for nonparametric scoring: the \textsc{TreeRank} algorithm and other methods

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