Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
An Empirical Comparison of Pruning Methods for Ensemble Classifiers
| |
|
An Empirical Comparison of Pruning Methods for Ensemble Classifiers
Terry Windeatt5 and Gholamreza Ardeshir5 
| (5) |
Centre for Vision, Speech and Signal Processing, School of Electronics Engineering, Information Technology and Mathematics, Guildford, Surrey, Gu2 7XH, UK |
Abstract
Many researchers have shown that ensemble methods such as Boosting and Bagging improve the accuracy of classification. Boosting
and Bagging perform well with unstable learning algorithms such as neural networks or decision trees. Pruning decision tree
classifiers is intended to make trees simpler and more comprehensible and avoid over-fitting. However it is known that pruning
individual classifiers of an ensemble does not necessarily lead to improved generalisation. Examples of individual tree pruning
methods are Minimum Error Pruning (MEP), Error-based Pruning (EBP), Reduced-Error Pruning(REP), Critical Value Pruning (CVP)
and Cost-Complexity Pruning (CCP). In this paper, we report the results of applying Boosting and Bagging with these five pruning
methods to eleven datasets.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|