Back to Search
Start Over
Comparing Boosting and Bagging Techniques With Noisy and Imbalanced Data.
- Source :
- IEEE Transactions on Systems, Man & Cybernetics: Part A; 05/01/2011, Vol. 41 Issue 3, p552-568, 17p
- Publication Year :
- 2011
-
Abstract
- This paper compares the performance of several boosting and bagging techniques in the context of learning from imbalanced and noisy binary-class data. Noise and class imbalance are two well-established data characteristics encountered in a wide range of data mining and machine learning initiatives. The learning algorithms studied in this paper, which include SMOTEBoost, RUSBoost, Exactly Balanced Bagging, and Roughly Balanced Bagging, combine boosting or bagging with data sampling to make them more effective when data are imbalanced. These techniques are evaluated in a comprehensive suite of experiments, for which nearly four million classification models were trained. All classifiers are assessed using seven different performance metrics, providing a complete perspective on the performance of these techniques, and results are tested for statistical significance via analysis-of-variance modeling. The experiments show that the bagging techniques generally outperform boosting, and hence in noisy data environments, bagging is the preferred method for handling class imbalance. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 10834427
- Volume :
- 41
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Systems, Man & Cybernetics: Part A
- Publication Type :
- Academic Journal
- Accession number :
- 60216901
- Full Text :
- https://doi.org/10.1109/TSMCA.2010.2084081