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.
My Menu
Saved Items

An Empirical Comparison of Pruning Methods for Ensemble Classifiers

Terry WindeattContact Information and Gholamreza ArdeshirContact Information

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

Contact Information Terry Windeatt
Email: T.Windeatt@eim.surrey.ac.uk

Contact Information Gholamreza Ardeshir
Email: g.ardeshir@eim.surrey.ac.uk
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.106 • Server: mpweb15
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)