Generating diverse ensembles to counter the problem of class imbalance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6119 LNAI, Issue PART 2, 2010, Pages 488-499

  Hoens, T Ryan ^a   Chawla, Nitesh V ^a  

^a UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASS IMBALANCE; CLASS IMBALANCE PROBLEMS; DATA MINING COMMUNITY; DATA SETS; DIVERSE ENSEMBLES; IMBALANCED DATA-SETS; RANDOM SUBSPACES; SAMPLING METHOD;

DATA MINING;

EID: 79956326532     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13672-6_46     Document Type: Conference Paper

References (24)

1. Chawla, N.V., Cieslak, D.A., Hall, L.O., Joshi, A.: Automatically countering imbalance and its empirical relationship to cost. Data Mining and Knowledge Discovery 17(2), 225-252 (2008)
2. Dietterich, T.G.: Ensemble methods in machine learning. In: Kittler, J., Roli, F. (eds.) MCS 2000. LNCS, vol. 1857, pp. 1-15. Springer, Heidelberg (2000)
3. Breiman, L.: Bagging predictors. Machine Learning 24(2), 123-140 (1996) (Pubitemid 126724382)
4. Freund, Y., Schapire, R.: Experiments with a new boosting algorithm. In: Thirteenth International Conference on Machine Learning (1996)
5. Chawla, N.V., Lazarevic, A., Hall, L.O., Bowyer, K.W.: Smoteboost: improving prediction of the minority class in boosting. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol. 2838, pp. 107-119. Springer, Heidelberg (2003) (Pubitemid 37231089)
6. Liu, X.Y., Wu, J., Zhou, Z.H.: Exploratory under-sampling for class-imbalance learning. In: ICDM '06: Proceedings of the Sixth International Conference on Data Mining, Washington, DC, USA, pp. 965-969. IEEE Computer Society, Los Alamitos (2006) (Pubitemid 47485889)
7. Guo, H., Viktor,H.L.: Learning from imbalanced data sets with boosting and data generation: the databoost-im approach. In: SIGKDD Explorations, pp. 30-39. ACM, New York (2004)
8. Ho, T.: The random subspace method for constructing decision forests. Pattern Analysis and Machine Intelligence 20(8), 832-844 (1998) (Pubitemid 128741345)
9. Chawla, N.V., Sylvester, J.: Exploiting diversity in ensembles: Improving the performance on unbalanced datasets. In: Haindl, M., Kittler, J., Roli, F. (eds.) MCS 2007. LNCS, vol. 4472, pp. 397-406. Springer, Heidelberg (2007) (Pubitemid 350284265)
10. Cieslak, D.A., Chawla, N.V.: Learning decision trees for unbalanced data. In: Daelemans, W., et al. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol. 5211, pp. 241-256. Springer, Heidelberg (2008)
11. Asuncion, A., Newman, D.: UCI machine learning repository (2007)
12. Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines (2001), Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm
13. DeGroot, M., Schervish, M.: Probability and Statistics, 3rd edn. Addison-Wesley, Reading (2001)
14. Demsar, J.: Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research 7, 1-30 (2006) (Pubitemid 43022939)
15. Kuncheva, L.I., Whitaker, C.J.: Measures of diversity in classifier ensembles. Machine Learning 51, 181-207 (2003)
16. Dietterich, T.G.: An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning 40(19), 139-157 (2000)
17. Hansen, L.K., Salamon, P.: Neural network ensembles. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(10), 993-1001 (1990)
18. Kotsiantis, S., Pintelas, P.: Combining bagging and boosting. International Journal of Computational Intelligence 1(4), 324-333 (2004)
19. Breiman, L.: Random forests. Machine Learning 45(1), 5-32 (2001) (Pubitemid 32933532)
20. Hido, S., Kashima, H.: Roughly balanced bagging for imbalanced data. In: Statistical Analysis and Data Mining, pp. 143-152. SIAM, Philadelphia (2008)
21. Drummond, C., Holte, R.C.: C4.5, class imbalance, and cost sensitivity: Why undersampling beats over-sampling. In: ICML Workshop on Learning from Imbalanced Datasets II (2003)
22. Weiss, G.M., Provost, F.: Learning when training data are costly: the effect of class distribution on tree induction. Journal of Artifical Intelligent Research 19, 315-354 (2003) (Pubitemid 41525924)
23. Batista, G.E.A.P.A., Prati, R.C., Monard, M.C.: A study of the behavior of several methods for balancing machine learning training data. SIGKDD Explorations 6, 20-29 (2004)
24. Chawla, N.V., Bowyer, K.W., Hall, L.O., Kegelmeyer, W.P.: SMOTE: Synthetic minority over-sampling technique. Journal of Artificial Intelligence Research 16, 321-357 (2002) (Pubitemid 43057176)