login

An efficient weighted Lagrangian twin support vector machine for imbalanced data classification

Pattern RecognitionPublished 25 March 2014
Yuan‐Hai Shao, Wei-Jie Chen, Jingjing Zhang, Zhen Wang, Nai-Yang Deng
Citations157
SJR quartileQ1
SJR score2.06
SNIP2.67

TL;DR

A graph based under-sampling strategy is introduced to keep the proximity information, which is robustness to outliers, and the weight biases are embedded in the Lagrangian TWSVM formulations, which overcomes the bias phenomenon.

Abstract

In this paper, we propose an efficient weighted Lagrangian twin support vector machine (WLTSVM) for the imbalanced data classification based on using different training points for constructing the two proximal hyperplanes. The main contributions of our WLTSVM are: (1) a graph based under-sampling strategy is introduced to keep the proximity information, which is robustness to outliers, (2) the weight biases are embedded in the Lagrangian TWSVM formulations, which overcomes the bias phenomenon in the original TWSVM for the imbalanced data classification, (3) the convergence of the training procedure of Lagrangian functions is proven and (4) it is tested and compared with some other TWSVMs on synthetic and real datasets to show its feasibility and efficiency for the imbalanced data classification.

Keywords

Computer Science