Building decision trees for the multi-class imbalance problem

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

Volumn 7301 LNAI, Issue PART 1, 2012, Pages 122-134

  Hoens, T Ryan ^a   Qian, Qi ^b   Chawla, Nitesh V ^a   Zhou, Zhi Hua ^b  

^a University of Notre Dame   (United States)

^b NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CLASS IMBALANCE PROBLEMS; DATA SETS; DECOMPOSITION TECHNIQUE; HELLINGER DISTANCE; IMBALANCE PROBLEM; IMBALANCED DATA-SETS; MISCLASSIFICATIONS; MULTI-CLASS; REAL-WORLD APPLICATION; RELATIVE FREQUENCIES; SPLITTING CRITERION;

DATA MINING; DATA PROCESSING; FORESTRY;

DECISION TREES;

DATA PROCESSING; DECISION MAKING; FORESTRY; PROBLEM SOLVING;

EID: 84861442505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-30217-6_11     Document Type: Conference Paper

References (21)

1. Breiman, L.: Bagging predictors. Machine Learning 24(2), 123-140 (1996)
2. Chawla, N.V., Bowyer, K.W., Hall, L.O., Kegelmeyer, W.P.: Smote: Synthetic minority over-sampling technique. JAIR 16, 321-357 (2002)
3. Chawla, N.V.: Data mining for imbalanced datasets: An overview. In: Data Mining and Knowledge Discovery Handbook, pp. 875-886 (2010)
4. Cieslak, D.A., Chawla, N.V.: Learning Decision Trees for Unbalanced Data. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol. 5211, pp. 241-256. Springer, Heidelberg (2008)
5. Cieslak, D.A., Chawla, N.V.: Start globally, optimize locally, predict globally: Improving performance on imbalanced data. In: ICDM, pp. 143-152 (2008)
6. Demšar, J.: Statistical comparisons of classifiers over multiple data sets. JMLR 7, 30 (2006)
7. Dietterich, T., Bakiri, G.: Error-correcting output codes: A general method for improving multiclass inductive learning programs. In: AAAI, pp. 395-395 (1994)
8. Domingos, P.: Metacost: A general method for making classifiers cost-sensitive. In: KDD, pp. 155-164 (1999)
9. Freund, Y., Schapire, R.: A Desicion-Theoretic Generalization of On-Line Learning and an Application to Boosting. In: Vitányi, P.M.B. (ed.) EuroCOLT 1995. LNCS, vol. 904, pp. 23-37. Springer, Heidelberg (1995)
10. Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The weka data mining software: an update. SIGKDD Exp. News. 11(1), 10-18 (2009)
11. Krogh, A., Vedelsby, J.: Neural network ensembles, cross validation, and active learning. In: NIPS, pp. 231-238 (1995)
12. Maloof, M.A.: Learning when data sets are imbalanced and when costs are unequal and unknown. In: ICML WLIDS (2003)
13. Provost, F., Domingos, P.: Tree induction for probability-based ranking. Machine Learning 52(3), 199-215 (2003)
14. Quinlan, J.R.: Induction of decision trees. Machine Learning 1(1), 81-106 (1986)
15. Raeder, T., Hoens, T., Chawla, N.: Consequences of Variability in Classifier Performance Estimates. In: ICDM, pp. 421-430 (2010)
16. Rifkin, R., Klautau, A.: In defense of one-vs-all classification. JMLR 5, 101-141 (2004)
17. Ting, K.M.: An instance-weighting method to induce cost-sensitive trees. TKDE 14(3), 659-665 (2002)
18. Turney, P.D.: Types of cost in inductive concept learning. In: ICML, pp. 15-21 (2000)
19. Van Calster, B., Van Belle, V., Condous, G., Bourne, T., Timmerman, D., Van Huffel, S.: Multi-class auc metrics and weighted alternatives. In: IJCNN, pp. 1390-1396 (2008)
20. Zhou, Z.-H., Liu, X.-Y.: On multi-class cost-sensitive learning. In: AAAI, pp. 567-572 (2006)
21. Zhou, Z.-H., Liu, X.-Y.: Training cost-sensitive neural networks with methods addressing the class imbalance problem. TKDE 18(1), 63-77 (2006)