Impact of subsampling and tree depth on random forests

From MaRDI portal
Publication:4615432

DOI10.1051/PS/2018008zbMATH Open1409.62072arXiv1603.04261OpenAlexW2794159684MaRDI QIDQ4615432FDOQ4615432


Authors: Roxane Duroux, Erwan Scornet Edit this on Wikidata


Publication date: 28 January 2019

Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)

Abstract: Random forests are ensemble learning methods introduced by Breiman (2001) that operate by averaging several decision trees built on a randomly selected subspace of the data set. Despite their widespread use in practice, the respective roles of the different mechanisms at work in Breiman's forests are not yet fully understood, neither is the tuning of the corresponding parameters. In this paper, we study the influence of two parameters , namely the subsampling rate and the tree depth, on Breiman's forests performance. More precisely, we show that fully developed sub-sampled forests and pruned (without subsampling) forests have similar performances, as long as respective parameters are well chosen. Moreover , experiments show that a proper tuning of subsampling or pruning lead in most cases to an improvement of Breiman's original forests errors.


Full work available at URL: https://arxiv.org/abs/1603.04261




Recommendations




Cites Work


Cited In (8)

Uses Software





This page was built for publication: Impact of subsampling and tree depth on random forests

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