Quasi-Linear SVM with Local Offsets for High-dimensional Imbalanced Data Classification
Yanze Li, Harutoshi Ogai · 2020
Imbalanced problems often occur in the classification problem. A special case is within-class imbalance, which worsen the imbalance distribution problem and increase the learning concept complexity. Most methods for solving imbalanced data classification focus on finding a globe boundary to solve between-class imbalance problem. My thesis proposes a effective quasi-linear network with local offsets adjustment for imbalanced classification problems. First, we proposed a gated piecewise linear network, an autoencoder-based partitioning method is modified for imbalanced datasets to divide input space into multiple linearly separable partitions along the potential separation boundary. Construct a quasi-linear SVM based on the gated signal that obtained by autoencoder partitioning information. Then training a neural network that let F-score as loss function to generate the local offsets on each local cluster. Finally a quasi-linear SVM classifier with local offsets is constructed for the imbalanced datasets. Our proposed method avoids calculating Euclidean distance, so it can be applied to high dimensional datasets. Simulation results on different real world datasets that our method is effective for imbalanced data classification especially in high-dimensional data.