DBMUTE: density-based majority under-sampling technique

• Main Authors: Chumphol Bunkhumpornpat, Krung Sinapiromsaran
• Format: Journal
• Published: 2018
• Subjects: Computer Science
• Online Access: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84970990065&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/57100
• Institution: Chiang Mai University

© 2016, Springer-Verlag London. Class imbalance is a challenging problem that demonstrates the unsatisfactory classification performance of a minority class. A trivial classifier is biased toward minority instances because of their tiny fraction. In this paper, our density function is defined as the distance along the shortest path between each majority instance and a minority-cluster pseudo-centroid in an underlying cluster graph. A short path implies highly overlapping dense minority instances. In contrast, a long path indicates a sparsity of instances. A new under-sampling algorithm is proposed to eliminate majority instances with low distances because these instances are insignificant and obscure the classification boundary in the overlapping region. The results show predictive improvements on a minority class from various classifiers on different UCI datasets.