Sequential boosting for learning a random forest classifier

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Authors

Research Organisations

External Research Organisations

  • University of Science and Technology of China
View graph of relations

Details

Original languageEnglish
Title of host publicationProceedings
Subtitle of host publication2015 IEEE Winter Conference on Applications of Computer Vision, WACV 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages442-447
Number of pages6
ISBN (electronic)9781479966820
Publication statusPublished - 19 Feb 2015
Event2015 15th IEEE Winter Conference on Applications of Computer Vision, WACV 2015 - Waikoloa, United States
Duration: 5 Jan 20159 Jan 2015

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.

ASJC Scopus subject areas

Cite this

Sequential boosting for learning a random forest classifier. / Baumann, Florian; Ehlers, Arne; Rosenhahn, Bodo et al.
Proceedings: 2015 IEEE Winter Conference on Applications of Computer Vision, WACV 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 442-447 7045919.

Research output: Chapter in book/report/conference proceedingConference contributionResearchpeer review

Baumann, F, Ehlers, A, Rosenhahn, B & Liu, W 2015, Sequential boosting for learning a random forest classifier. in Proceedings: 2015 IEEE Winter Conference on Applications of Computer Vision, WACV 2015., 7045919, Institute of Electrical and Electronics Engineers Inc., pp. 442-447, 2015 15th IEEE Winter Conference on Applications of Computer Vision, WACV 2015, Waikoloa, United States, 5 Jan 2015. https://doi.org/10.1109/wacv.2015.65
Baumann, F., Ehlers, A., Rosenhahn, B., & Liu, W. (2015). Sequential boosting for learning a random forest classifier. In Proceedings: 2015 IEEE Winter Conference on Applications of Computer Vision, WACV 2015 (pp. 442-447). Article 7045919 Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/wacv.2015.65
Baumann F, Ehlers A, Rosenhahn B, Liu W. Sequential boosting for learning a random forest classifier. In Proceedings: 2015 IEEE Winter Conference on Applications of Computer Vision, WACV 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 442-447. 7045919 doi: 10.1109/wacv.2015.65
Baumann, Florian ; Ehlers, Arne ; Rosenhahn, Bodo et al. / Sequential boosting for learning a random forest classifier. Proceedings: 2015 IEEE Winter Conference on Applications of Computer Vision, WACV 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 442-447
Download
@inproceedings{775f4c2ecdac480a909fe5db7a9e1ef9,
title = "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.",
author = "Florian Baumann and Arne Ehlers and Bodo Rosenhahn and Wei Liu",
year = "2015",
month = feb,
day = "19",
doi = "10.1109/wacv.2015.65",
language = "English",
pages = "442--447",
booktitle = "Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",
note = "2015 15th IEEE Winter Conference on Applications of Computer Vision, WACV 2015 ; Conference date: 05-01-2015 Through 09-01-2015",

}

Download

TY - GEN

T1 - Sequential boosting for learning a random forest classifier

AU - Baumann, Florian

AU - Ehlers, Arne

AU - Rosenhahn, Bodo

AU - Liu, Wei

PY - 2015/2/19

Y1 - 2015/2/19

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84925388288&partnerID=8YFLogxK

U2 - 10.1109/wacv.2015.65

DO - 10.1109/wacv.2015.65

M3 - Conference contribution

AN - SCOPUS:84925388288

SP - 442

EP - 447

BT - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2015 15th IEEE Winter Conference on Applications of Computer Vision, WACV 2015

Y2 - 5 January 2015 through 9 January 2015

ER -

By the same author(s)