Name
Abstract | ||
|---|---|---|
We experimentally evaluated bagging and six other randomization-based ensemble tree methods. Bagging uses randomization to create multiple training sets. Other approaches, such as Randomized C4.5, apply randomization in selecting a test at a given node of a tree. Then there are approaches, such as random forests and random subspaces, that apply randomization in the selection of attributes to be used in building the tree. On the other hand boosting incrementally builds classifiers by focusing on examples misclassified by existing classifiers. Experiments were performed on 34 publicly available data sets. While each of the other six approaches has some strengths, we find that none of them is consistently more accurate than standard bagging when tested for statistical significance. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-25966-4_22 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
decision tree,random forest | Random tree,Decision tree,Data set,Computer science,Randomization,Artificial intelligence,Boosting (machine learning),Random forest,Machine learning,Bootstrapping (electronics),Statistical hypothesis testing | Conference |
Volume | ISSN | Citations |
3077 | 0302-9743 | 24 |
PageRank | References | Authors |
2.06 | 13 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert E. Banfield | 1 | 358 | 17.16 |
| Lawrence O. Hall | 2 | 5543 | 335.87 |
| Kevin W. Bowyer | 3 | 11121 | 734.33 |
| Divya Bhadoria | 4 | 44 | 3.83 |
| W. Philip Kegelmeyer | 5 | 3498 | 146.54 |
| Steven Eschrich | 6 | 89 | 10.81 |