Sequential Boosting for Learning a Random Forest Classifier
Abstract
This paper introduces a novel tree induction algorithm called sequential Random Forest (sRF) to improve the detection accuracy of a standard Random Forest classifier. Observations have shown that the overall performance of a forest is strongly influenced by the number of training samples. The main idea is to sequentially adapt the number of training samples per class so that each tree better complements the existing trees in the whole forest. Further, we propose a weighted majority voting with respect to a class and tree specific error rate for decreasing the influence of poorly performing trees. The sRF algorithm shows competing results in comparison to state-of-the-art approaches using two datasets for object recognition, two standard machine learning datasets and three datasets for human action recognition.
Cite
Text
Baumann et al. "Sequential Boosting for Learning a Random Forest Classifier." IEEE/CVF Winter Conference on Applications of Computer Vision, 2015. doi:10.1109/WACV.2015.65Markdown
[Baumann et al. "Sequential Boosting for Learning a Random Forest Classifier." IEEE/CVF Winter Conference on Applications of Computer Vision, 2015.](https://mlanthology.org/wacv/2015/baumann2015wacv-sequential/) doi:10.1109/WACV.2015.65BibTeX
@inproceedings{baumann2015wacv-sequential,
title = {{Sequential Boosting for Learning a Random Forest Classifier}},
author = {Baumann, Florian and Ehlers, Arne and Rosenhahn, Bodo and Liu, Wei},
booktitle = {IEEE/CVF Winter Conference on Applications of Computer Vision},
year = {2015},
pages = {442-447},
doi = {10.1109/WACV.2015.65},
url = {https://mlanthology.org/wacv/2015/baumann2015wacv-sequential/}
}