Ranking Forests

Abstract : The present paper examines how the aggregation and feature randomization principles underlying the algorithm RANDOM FOREST (Breiman, 2001) can be adapted to bipartite ranking. The approach taken here is based on nonparametric scoring and ROC curve optimization in the sense of the AUC criterion. In this problem, aggregation is used to increase the performance of scoring rules produced by ranking trees, as those developed in Clémençon and Vayatis (2009c). The present work describes the principles for building median scoring rules based on concepts from rank aggregation. Consistency results are derived for these aggregated scoring rules and an algorithm called RANKING FOREST is presented. Furthermore, various strategies for feature randomization are explored through a series of numerical experiments on artificial data sets.
Complete list of metadatas

Cited literature [54 references]  Display  Hide  Download

https://hal.telecom-paristech.fr/hal-02107371
Contributor : Stephan Clémençon <>
Submitted on : Tuesday, April 23, 2019 - 4:18:19 PM
Last modification on : Wednesday, July 3, 2019 - 3:02:03 PM

File

clemencon13a.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02107371, version 1

Citation

Stéphan Clémençon, Marine Depecker, Nicolas Vayatis. Ranking Forests. Journal of Machine Learning Research, Microtome Publishing, 2013, 14, pp.39 - 73. ⟨hal-02107371⟩

Share

Metrics

Record views

14

Files downloads

9