Imbalanced data classification using random subspace method and SMOTE

6th International Conference on Soft Computing and Intelligent Systems, and 13th International Symposium on Advanced Intelligence Systems, SCIS/ISIS 2012

Volumn , Issue , 2012, Pages 817-820

  Huang, Hsiao Yun ^a   Lin, Yi Jhen ^a   Chen, Youg Siang ^a   Lu, Hung Yi ^a  

^a FU JEN CATHOLIC UNIVERSITY   (Taiwan)

Author keywords

Bagging; Boosting; Class imbalance; Multi classifier ensemble; RSM; SMOTE

Indexed keywords

BAGGING; BOOSTING; CLASS IMBALANCE; MULTI-CLASSIFIER; RSM; SMOTE;

INTELLIGENT SYSTEMS; SOFT COMPUTING;

EXPERIMENTS;

EID: 84877816030     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCIS-ISIS.2012.6505155     Document Type: Conference Paper

References (17)

1. T. Fawcett, F. Provost, Adaptive Fraud detection. Data Mining and Knowledge Discovery (1), 291-316, 1997.
2. N. V. Chawla, L. O. Hall, K. W. Bowyer, and W. P. Kegelmeyer,"SMOTE: Synthetic Minority Oversampling Technique," Journal of Artificial Intelligence Research, vol. 16, pp. 321-357, 2002.
3. M. Kubat and S. Matwin,"Addressing the curse of imbalanced training sets: one-sided selection," in Proc. of the 14th Int. Conf. on Machine Learning, pp. 179-186, 1997.
4. N. Japkowicz, The Class Imbalance Problem: Significance and Strategies. In Proceedings of the 2000 International Conference on Artificial Intelligence, 2000.
5. C. X. Ling, C. Li, Data Mining for Direct Marketing Problems and Solutions. In Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98) New York, NY. AAAI Press, 1998.
6. N. Chawla, K. Bowyer, L. Hall, and P. Kegelmeyer,"SMOTE: Synthetic Minority Over-sampling Technique," In International Conference of Knowledge Based Computer Systems, National Center for Software Technology, Mumbai, India, Allied Press, pp. 46-57, 2000.
7. N. V. Chawla, Many are better than one: Improving probabilistic estimates from decision trees. In Machine Learning Challenges. pp. 41-55, 2006.
8. H. Y. Huang, Y. W. Cheng, Efficient Weighted Voting Random Subspace Support Vector Machine for High-Dimensional Classification. Adv. Sci. Lett. vol. 8, pp. 354-359, 2012.
9. L. Breiman,"Bagging predictors," Machine Learning, vol. 24, pp. 123-140, 1996.
10. L. Breiman,"Random forests," Machine Learning, vol. 45, pp. 5-32, 2001.
11. Y. Freund, R. E. Schapire,"A decision-theoretic generalization of online learning and an application to boosting," J. Comput. Syst. Sci. vol. 55, 119-139, 1997.
12. C. Chen, A. Liaw and L. Breiman," Using random forest to learn imbalanced data," Technical Report, No. 666, Department of Statistics, University of California at Berkeley, 2004.
13. Y. Sun, M. S. Kamela, A. K.C. Wong, Y. Wang, Cost-sensitive boosting for classification of imbalanced data. Pattern Recognition, vol. 40, pp. 3358-3378, 2007.
14. T. K. Ho,"The Random subspace method for constructing decision forests," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, pp. 832-844, 1998.
15. Frank, A. & Asuncion, A, UCI Machine Learning Repository [http://archive.ics.uci.edu/ml]. Irvine, CA: University of California, School of Information and Computer Science.
16. I. C. Yeh, K. J. Yang, T. M. Ting,"Knowledge discovery on RFM model using Bernoulli sequence," Expert Systems with Applications, vol. 36(3), pp. 5866-5871, 2009.
17. N. V. Chawla, A. Lazarevic, L. O. Hall and K. W. Bowyer,"SMOTEBoost: Improving Prediction of the Minority Class in Boosting," in 7th European Conference on Principles and Practice of Knowledge Discovery in Databases Cavtat-Dubrovnik, Croatia, pp. 107-119, September 2003.