arrow
Return

A novel projection twin support vector machine for binary classification

delete2017-12-11
delete7
PRE
AI
S
Sugen Chen
X
Xiao‐Jun Wu *
H
He-Feng Yin
DOI:10.1007/s00500-017-2974-zdelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Based on the recently proposed projection twin support vector machine (PTSVM) and projection twin support vector machine with regularization term (RPTSVM), we propose a novel projection twin support vector machine (NPTSVM) for binary classification problems. Our proposed NPTSVM seeks two optimal projection directions simultaneously by solving a single quadratic programming problem, and the projected samples of one class are well separated from those of another class to some extent. Similar to RPTSVM, the singularity of matrix is avoided and the structural risk minimization principle is implemented in our NPTSVM. In addition, in our NPTSVM, we also discuss the nonlinear classification scenario which is not covered in PTSVM. The experimental results on several artificial and publicly available benchmark datasets show the feasibility and effectiveness of the proposed method.
Keywords:
Machine learning
Binary classification
Twin support vector machine
Projection twin support vector machine
Successive overrelaxation technique
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Soft Computing cover
Soft Computing
IF:
2.5
Papers:
1.0W
Citations:
2.1W

Organization

A
Anqing Normal University
Scholars:
1.4K
Papers: 902
Citations: 1.0K
J
Jiangnan University
Scholars:
3.9W
Papers: 2.7W
Citations: 4.7W