Distributed Sparse Class-Imbalance Learning and Its Applications
Chandresh Kumar Maurya, Durga Toshniwal, Gopalan Vijendran Venkoparao · IEEE Transactions on Big Data · 2017
In the present work, the study on class imbalance problems in adistributedsetting exploiting sparsity structure in the data has been carried out. We formulate the class-imbalance learning problem as a cost-sensitive learning problem with$L_1$regularization. The cost-sensitive loss function is a cost-weighted smooth hinge loss. The resultant optimization problem is minimized within theDistributed Alternating Direction Method of Multiplier(DADMM) framework. We partition the data matrix across samples. This operation splits the original problem into a distributed$L_2$regularized smooth loss minimization and a$L_1$regularized squared loss minimization.$L_2$regularized subproblem is solved via Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) and random coordinate descent method in parallel at multiple processing nodes usingMPIwhereas$L_1$regularized problem is just a simple soft-thresholding operation. We show, empirically, that the distributed solution approximates the centralized solution on many benchmark data sets. The centralized solution is obtained via Cost-Sensitive Stochastic Coordinate Descent (CSSCD). Empirical results on small and large-scale benchmark datasets show some promising avenues to further investigate the real-world applications of the proposed algorithms such as anomaly detection, class-imbalance learning, etc. To the best of our knowledge, ours is the first work to study class-imbalance in adistributedenvironment on large-scalesparsedata.