Robust projection twin support vector machine via DC programming

Abstract

In this paper, we propose a robust projection twin support vector machine (RPTSVM), where a new truncated $L_2$-norm distance measure is applied to the with-class scatter to boost the robustness of the classifier when encountering a large number of outliers. In order to further improve the robustness of the model, chance constraints are employed to specify the lower bound of the probability that the distance from the projected samples to the projection of the other class centre is at least one. RPTSVM considers a pair of non-convex non-smooth problems with chance constraints. To solve these difficult problems, a newly designed method based on the difference of convex functions (DC) programs approach is presented. Extensive experiments on artificial datasets and benchmark datasets demonstrate the robustness and feasibility of our proposed RPTSVM.

Keywords:

• Projection twin support vector machine
• chance constraint
• DC programming
• robustness

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This research is partially supported by National Natural Science Foundation of China [grant number 11871128], Natural Science Foundation of Chongqing [grant number cstc2019jcyj-msxmX0282] and Scientific and Technological Research Program of Chongqing Municipal Education Commission [grant number KJQN201900531] and Chongqing University Innovation Research Group Project [grant number CXQT20014].