Robust projection twin support vector machine via DC programming. (3rd April 2022)

• Record Type: Journal Article
• Authors: Li, Guoquan; Yin, Lin; Yang, Linxi; Wu, Zhiyou
• Is Part Of: Optimization. Volume 71:Number 4(2022)
• Page Start: 1189
• Page End: 1211
• Publication Date: 2022-04-03
• Subjects: Projection twin support vector machine -- chance constraint -- DC programming -- robustness; Mathematical optimization -- Periodicals; 519.7
• DOI: 10.1080/02331934.2021.1960331
• Languages: English
• ISSNs: 0233-1934

Abstract

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.