Cost-sensitive learning methods for imbalanced data

Proceedings of the International Joint Conference on Neural Networks

Volumn , Issue , 2010, Pages

  Thai Nghe, Nguyen ^a   Gantner, Zeno ^a   Schmidt Thieme, Lars ^a  

^a UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); COSTS; DATA MINING; LEARNING ALGORITHMS;

CLASS IMBALANCE; COST-SENSITIVE LEARNING; EMPIRICAL METHOD; FALSE NEGATIVE RATE; IMBALANCED DATA; LEARNING METHODS; MACHINE LEARNING ALGORITHMS; RESAMPLING; RESAMPLING TECHNIQUE; SAMPLING TECHNIQUE;

SUPPORT VECTOR MACHINES;

EID: 79959486532     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2010.5596486     Document Type: Conference Paper

References (42)

1. N. V. Chawla, N. Japkowicz, and A. Kotcz, "Editorial: special issue on learning from imbalanced data sets," SIGKDD Explorations, vol. 6, no. 1, pp. 1-6, 2004.
2. H. He and E. A. Garcia, "Learning from imbalanced data," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 9, pp. 1263-1284, September 2009.
3. Q. Yang and X. Wu, "10 challenging problems in data mining research," International Journal of Information Technology and Decision Making, vol. 5, no. 4, pp. 597-604, 2006.
4. N. V. Chawla, K. Bowyer, L. Hall, and W. P. Kegelmeyer, "SMOTE: synthetic minority over-sampling technique," Journal of AI Research, vol. 16, pp. 321-357, 2002.
5. A. Nickerson, N. Japkowicz, and E. Millos, "Using unsupervised learning to guide resampling in imbalanced data sets," in Proceedings of the Eighth International Workshop on AI and Statitsics, 2001, pp. 261-265.
6. P. Li, P.-L. Qiao, and Y.-C. Liu, "A hybrid re-sampling method for SVM learning from imbalanced data sets," in Proceedings of the 2008 Fifth IC on Fuzzy Systems and Knowledge Discovery. Washington, DC, USA: IEEE Computer Society, 2008, pp. 65-69.
7. B. Raskutti and A. Kowalczyk, "Extreme re-balancing for SVMs: a case study," SIGKDD Explorations, vol. 6, no. 1, pp. 60-69, 2004.
8. P. E. Hart, "The condensed nearest neighbor rule," IEEE Trans. Inf. Theory, no. 16, pp. 515-516, 1968.
9. I. Tomek, "Two modifications of CNN," IEEE Transactions on Systems Man and Communications SMC-6, pp. 769-772, 1976.
10. D. L. Wilson, "Asymptotic properties of nearest neighbor rules using edited data," IEEE Transactions on Systems, Man and Cybernetics, no. 3, 1972.
11. X. wen Chen, B. Gerlach, and D. Casasent, "Pruning support vectors for imbalanced data classification," proceeding of IEEE International Joint Conference on Neural Networks, vol. 3, pp. 1883-1888, 2005.
12. S. Lessmann, "Solving imbalanced classification problems with support vector machines," in International Conference on Artificial Intelligence, 2004, pp. 214-220.
13. K. Veropoulos, C. Campbell, and N. Cristianini, "Controlling the sensitivity of support vector machines," in Proceedings of the IJCAI, 1999, pp. 55-60.
14. R. Yan, Y. Liu, R. Jin, and A. Hauptmann, "On predicting rare classes with SVM ensembles in scene classification," in ICASSP, 2003, pp. 21-24.
15. X.-Y. Liu, J. Wu, and Z.-H. Zhou, "Exploratory under-sampling for class-imbalance learning," IEEE Trans. on Syst, Man, and Cyber. Part B, pp. 539-550, 2009.
16. Y. Tang, Y. Zhang, N. Chawla, and S. Krasser, "SVMs modeling for highly imbalanced classification." IEEE Trans Syst Man Cybern B Cybern, vol. 39, no. 1, pp. 281-8, 2009.
17. B. Wang and N. Japkowicz, "Boosting support vector machines for imbalanced data sets," Knowledge and Information Systems, 2009.
18. X. Li, L. Wang, and E. Sung, "AdaBoost with SVM-based component classifiers," Eng. Appl. Artif. Intell., vol. 21, no. 5, pp. 785-795, 2008.
19. C. Elkan, "The foundations of cost-senstive learning," 17th International Joint Conference on Artificial Intelligence, pp. 973-978, 2001.
20. K. M. Ting, "Inducing cost-sensitive trees via instance weighting," in PKDD, 1998, pp. 139-147.
21. X.-Y. Liu and Z.-H. Zhou, "The influence of class imbalance on cost-sensitive learning: An empirical study," in Proceedings of the Sixth ICDM. Washington, DC, USA: IEEE Computer Society, 2006, pp. 970-974.
22. S. Sheng, C. X. Ling, A. Ni, and S. Zhang, "Cost-sensitive test strategies," in The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, 2006.
23. S. Sheng, C. X. Ling, and Q. Yang, "Simple test strategies for cost-sensitive decision trees," in ECML, 2005, pp. 365-376.
24. X. Chai, L. Deng, Q. Yang, and C. X. Ling, "Test-cost sensitive naive bayes classification," in International Conference on Data Mining, 2004, pp. 51-58.
25. K. M. Ting, "A study on the effect of class distribution using cost-sensitive learning," in Discovery Science, 2002, pp. 98-112.
26. R. Akbani, S. Kwek, and N. Japkowicz, "Applying support vector machines to imbalanced datasets," in Proceedings of the 15th ECML, 2004, pp. 39-50.
27. G. E. A. P. A. Batista, R. C. Prati, and M. C. Monard, "A study of the behavior of several methods for balancing machine learning training data," SIGKDD Explorations, vol. 6, no. 1, pp. 20-26, 2004.
28. J. Van Hulse, T. M. Khoshgoftaar, and A. Napolitano, "Experimental perspectives on learning from imbalanced data," in Proceedings of 24th ICML. ACM, 2007, pp. 935-942.
29. J. C. Platt, "Probabilistic outputs for SVM and comparisons to regularized likelihood methods," in Advances in Large Margin Classifiers. MIT Press, 1999, pp. 61-74.
30. P. Domingos, "Metacost: A general method for making classifiers cost-sensitive," 5th ACM SIGKDD International conference on Knowledge Discovery and Data mining KDD1999, pp. 155-164, 1999.
31. D. D. Margineantu, "When does imbalanced data require more than cost-sensitive learning?" in Workshop on Learning from Imbalanced Data, Artificial Intelligence (AAAI-2000), 2000.
32. D. J. Hand, "Classifier technology and the illusion of progress," Statistical Science, vol. 21, no. 1, pp. 1-14, Jun 2006.
33. M. Kubat and S. Matwin, "Addressing the curse of imbalanced training sets: One-sided selection," in Proceedings of the 14th ICML. Morgan Kaufmann, 1997, pp. 179-186.
34. V. S. Sheng and C. X. Ling, "Thresholding for making classifiers costsensitive," in AAAI, 2006.
35. C. W. Hsu, C. C. Chang, and C. J. Lin, A practical guide to support vector classification, Department of Computer Science and Information Engineering, National Taiwan University, 2003.
36. D. J. Hand, "Measuring classifier performance: A coherent alternative to the area under the ROC curve," Machine Learning, vol. 77, no. 1, pp. 103-123, October 2009.
37. S. Hido and H. Kashima, "Roughly balanced bagging for imbalanced data." in Proceedings of the SIAM International Conference on Data Mining, Atlanta, Georgia, USA. SIAM, 2008, pp. 143-152.
38. I. H. Witten and E. Frank, Data Mining: Practical machine learning tools and techniques, 2nd ed. Morgan Kaufmann, San Francisco, 2005.
39. N. Thai-Nghe, A. Busche, and L. Schmidt-Thieme, "Improving academic performance prediction by dealing with class imbalance," in Proceeding of 9th IEEE International Conference on Intelligent Systems Design and Applications (ISDA09), 2009.
40. R. C. Prati, G. E. A. P. A. Batista, and M. C. Monard, "Class imbalances versus class overlapping: An analysis of a learning system behavior," in MICAI04: Advances in AI, Mexico, 2004, pp. 312-321.
41. Y. Freund and R. E. Schapire, "Experiments with a new boosting algorithm," International Conference on Machine Learning, pp. 148-156, 1996.
42. R. E. Schapire, Y. Singer, and A. Singhal, "Boosting and rocchio applied to text filtering." in Proceedings of SIGIR-98, 21st ACM International Conference on Research and Development in Information Retrieval. ACM Press, New York, US, 1998, pp. 215-223.