Embedding Undersampling Rotation Forest for Imbalanced Problem

作者：Guo, Huaping^*; Diao, Xiaoyu; Liu, Hongbing

来源：Computational Intelligence and Neuroscience, 2018, 2018: 6798042.

DOI：10.1155/2018/6798042

• STATISTICAL COMPARISONS
• DATA SETS
• ENSEMBLE
• SMOTE
• CLASSIFIERS
• ALGORITHMS
• MACHINE
• TREES

Rotation Forest is an ensemble learning approach achieving better performance comparing to Bagging and Boosting through building accurate and diverse classifiers using rotated feature space. However, like other conventional classifiers, Rotation Forest does not work well on the imbalanced data which are characterized as having much less examples of one class (minority class) than the other (majority class), and the cost of misclassifying minority class examples is often much more expensive than the contrary cases. This paper proposes a novel method called Embedding Undersampling Rotation Forest (EURF) to handle this problem (1) sampling subsets from the majority class and learning a projection matrix from each subset and (2) obtaining training sets by projecting re-undersampling subsets of the original data set to new spaces defined by the matrices and constructing an individual classifier from each training set. For the first method, undersampling is to force the rotation matrix to better capture the features of the minority class without harming the diversity between individual classifiers. With respect to the second method, the undersampling technique aims to improve the performance of individual classifiers on the minority class. The experimental results show that EURF achieves significantly better performance comparing to other state-of-the-art methods.

• 出版日期2018
• 单位信阳师范学院