.png){kind=icon}
Return
A coordinate descent margin based-twin support vector machine for classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2011.08.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Twin support vector machines (TWSVMs) obtain faster learning speed by solving a pair of smaller SVM-type problems. In order to increase its efficiency further, this paper presents a coordinate descent margin based twin vector machine (CDMTSVM) compared with the original TWSVM. The major advantages of CDMTSVM lie in two aspects: (1) The primal and dual problems are reformulated and improved by adding a regularization term in the primal problems which implies maximizing the margin between the proximal hyperplane and bounding hyperplane, yielding the dual problems to be stable positive definite quadratic programming problems. (2) A novel coordinate descent method is proposed for our dual problems which leads to very fast training. As our coordinate descent method handles one data point at a time, it can process very large datasets that need not reside in memory. Our experiments on publicly available datasets indicate that our CDMTSVM is not only fast, but also shows good generalization performance. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Pattern classification
Twin support vector machines
Maximum margin
Coordinate descent method
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
8.2K
Citations:
3.0W
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveThe GxxxG-Containing Transmembrane Domain of the CCK4 Oncogene Does Not Encode Preferential Self-Interactions.png)
Biochemistry
BiochemistryIF0
PREAI
ShareSave
View more