A class skew-insensitive ACO-based decision tree algorithm for imbalanced data sets

• Main Authors: Mohd Razali, Muhamad Hasbullah, Saian, Rizauddin, Yap, Bee Wah, Ku-Mahamud, Ku Ruhana
• Format: Article
• Language: English
• Published: Institute of Advanced Engineering and Science 2021
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://repo.uum.edu.my/27849/1/IJEECS%2020%201%202021%20412%20419.pdf; http://repo.uum.edu.my/27849/; http://ijeecs.iaescore.com/index.php/IJEECS/article/view/22253

Ant-tree-miner (ATM) has an advantage over the conventional decision tree algorithm in terms of feature selection. However, real world applications commonly involved imbalanced class problem where the classes have different importance. This condition impeded the entropy-based heuristic of existing ATM algorithm to develop effective decision boundaries due to its biasness towards the dominant class. Consequently, the induced decision trees are dominated by the majority class which lack in predictive ability on the rare class. This study proposed an enhanced algorithm called hellingerant-tree-miner (HATM) which is inspired by ant colony optimization (ACO) metaheuristic for imbalanced learning using decision tree classification algorithm. The proposed algorithm was compared to the existing algorithm, ATM in nine (9) publicly available imbalanced data sets. Simulation study reveals the superiority of HATM when the sample size increases with skewed class (Imbalanced Ratio < 50%). Experimental results demonstrate the performance of the existing algorithm measured by BACC has been improved due to the class skew in sensitiveness of hellinger distance. The statistical significance test shows that HATM has higher mean BACC scorethan ATM.