An experimental comparison of three methods for constructing ensembles of decision trees (2000)
Cached
Download Links
| Venue: | Bagging, boosting, and randomization. Machine Learning |
| Citations: | 364 - 5 self |
BibTeX
@INPROCEEDINGS{Dietterich00anexperimental,
author = {Thomas G. Dietterich and Doug Fisher},
title = {An experimental comparison of three methods for constructing ensembles of decision trees},
booktitle = {Bagging, boosting, and randomization. Machine Learning},
year = {2000},
pages = {139--157}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Bagging and boosting are methods that generate a diverse ensemble of classifiers by manipulating the training data given to a “base ” learning algorithm. Breiman has pointed out that they rely for their effectiveness on the instability of the base learning algorithm. An alternative approach to generating an ensemble is to randomize the internal decisions made by the base algorithm. This general approach has been studied previously by Ali and Pazzani and by Dietterich and Kong. This paper compares the effectiveness of randomization, bagging, and boosting for improving the performance of the decision-tree algorithm C4.5. The experiments show that in situations with little or no classification noise, randomization is competitive with (and perhaps slightly superior to) bagging but not as accurate as boosting. In situations with substantial classification noise, bagging is much better than boosting, and sometimes better than randomization.
