Boosted tree ensembles for solving multiclass problems

DOI10.1007/3-540-45428-4_4MaRDI QIDQ3046285zbMATH OpenFDO

Authors Terry Windeatt, Gholamreza Ardeshir

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2364/23640042.htm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• An empirical comparison of pruning methods for ensemble classifiers
• Improved boosting algorithms using confidence-rated predictions
• Multiclass boosting for weak classifiers
• Multi-class AdaBoost
• scientific article; zbMATH DE number 1333813

Cited in

(8)

• Vote counting measures for ensemble classifiers.
• A simple boosting algorithm using multi-way branching decision trees
• scientific article; zbMATH DE number 5568407 (Why is no real title available?)
• An empirical comparison of pruning methods for ensemble classifiers
• A simpler analysis of the multi-way branching decision tree boosting algorithm
• Effect of pruning and early stopping on performance of a boosting ensemble.
• Consolidated trees versus bagging when explanation is required
• Pruning of error correcting output codes by optimization of accuracy-diversity trade off

This page was built for publication: Boosted tree ensembles for solving multiclass problems

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