Name
Abstract | ||
|---|---|---|
Working as an ensemble method that establishes a committee of classifiers first and then aggregates their outcomes through majority voting, bagging has attracted considerable research interest and been applied in various application domains. It has demonstrated several advantages, but in its present form, bagging has been found to be less accurate than some other ensemble methods. To unlock its power and expand its user base, we propose an approach that improves bagging through the use of multi-algorithm ensembles. In a multi-algorithm ensemble, multiple classification algorithms are employed. Starting from a study of the nature of diversity, we show that compared to using different training sets alone, using heterogeneous algorithms together with different training sets increases diversity in ensembles, and hence we provide a fundamental explanation for research utilizing heterogeneous algorithms. In addition, we partially address the problem of the relationship between diversity and accuracy by providing a non-linear function that describes the relationship between diversity and correlation. Furthermore, after realizing that the bootstrap procedure is the exclusive source of diversity in bagging, we use heterogeneity as another source of diversity and propose an approach utilizing heterogeneous algorithms in bagging. For evaluation, we consider several benchmark data sets from various application domains. The results indicate that, in terms of F1-measure, our approach outperforms most of the other state-of-the-art ensemble methods considered in experiments and, in terms of mean margin, our approach is superior to all the others considered in experiments. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-28320-8_40 | Frontiers of Computer Science |
Keywords | Field | DocType |
bagging,classification,diversity,ensemble | Data mining,Small data,Computer science,Artificial intelligence,Majority rule,Random forest,Ensemble learning,Algorithm,Outlier,Rotation forest,Sequential minimal optimization,Machine learning,Multiple classification | Journal |
Volume | Issue | ISSN |
6 | 5 | 2095-2228 |
Citations | PageRank | References |
0 | 0.34 | 39 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kuo-Wei Hsu | 1 | 53 | 6.38 |
| Jaideep Srivastava | 2 | 5845 | 871.63 |