Cost-complexity pruning of random forests
Machine Learning
2017-07-20 v2 Machine Learning
Abstract
Random forests perform bootstrap-aggregation by sampling the training samples with replacement. This enables the evaluation of out-of-bag error which serves as a internal cross-validation mechanism. Our motivation lies in using the unsampled training samples to improve each decision tree in the ensemble. We study the effect of using the out-of-bag samples to improve the generalization error first of the decision trees and second the random forest by post-pruning. A preliminary empirical study on four UCI repository datasets show consistent decrease in the size of the forests without considerable loss in accuracy.
Cite
@article{arxiv.1703.05430,
title = {Cost-complexity pruning of random forests},
author = {Kiran Bangalore Ravi and Jean Serra},
journal= {arXiv preprint arXiv:1703.05430},
year = {2017}
}
Comments
Previous version in proceedings of ISMM 2017