Research Article

A Hybrid Approach Using Oversampling Technique and Cost-Sensitive Learning for Bankruptcy Prediction

Table 3

The overall results of all experimental approaches for KRBDS.

NoMethodResample approachClassifierAUCG-meanAverage Rankp-value

1BGNoneBagging78.8±0.470.8±0.89.03.9×10−5

2ABNoneAdaBoost84.9±0.878.2±0.67.00.0023

3RFNoneRandom Forest86.2±0.679.9±0.64.70.069

4MLPNoneMLP86.7±0.880.1±1.02.60.487

5USC-BGUnder-sampling method based on clustering technique (USC) [43]Bagging65.1±1.653.6±4.911.21.2×10−7
6USC-ABAdaBoost59.7±3.056.3±5.012.95.6×10−10
7USC-RFRandom Forest64.7±1.062.6±1.911.91.5×10−8
8USC-MLPMLP46.9±2.736.5±3.714.01.1×10−11

9OSE-BGOversampling method using SMOTE-ENN (OSE) [41] Bagging83.9±0.377.4±0.37.85.1×10−4
10OSE-ABAdaBoost85.4±0.778.5±0.46.20.009
11OSE-RFRandom Forest86.6±0.780.2±1.03.30.285
12OSE-MLPMLP72.8±2.169.8±1.810.03.3×10−6

13RFCI [42]Under-sampling method using IHT conceptCBoost86.6±0.779.1±3.53.10.336

14HAOCOversampling method using SMOTE-ENN (with balancing ratio = 0.08)CBoost87.1±0.681.1±0.81.3-