.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Pattern classification
Twin support vector machines
Maximum margin
Coordinate descent method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
7.9K
被引数:
3.0W
机构
引用论文
分享收藏分享收藏The GxxxG-Containing Transmembrane Domain of the CCK4 Oncogene Does Not Encode Preferential Self-Interactions.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏
查看更多内容