.png){kind=icon}
返回
A clipping dual coordinate descent algorithm for solving support vector machines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2014.08.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The dual coordinate descent (DCD) algorithm solves the dual problem of support vector machine (SVM) by minimizing a series of single-variable sub-problems with a random order at inner iterations. Apparently, this DCD algorithm gives a sightless update for all variables at each iteration, which leads to a slow speed. In this paper, we present a clipping dual coordinate descent (clipDCD) algorithm for solving the dual problem of SVM. In each iteration, this clipDCD algorithm only solves one single-variable sub-problem according to the maximal possibility-decrease strategy on objective value. We can easily implement this clipDCD algorithm since it has a much simpler formulation compared with the DCD algorithm. Our experiment results indicate that, if the clipDCD algorithm is employed, SVM, twin SVM (TWSVM) and its extensions not only obtain the same classification accuracies, but also take much faster learning speeds than those classifiers employing the DCD algorithm. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Support vector machine
Dual coordinate descent algorithm
Single variable problem
Maximal possibility-decrease strategy
Learning speed
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Recursive projection twin support vector machine via within-class variance minimization.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
The GxxxG-Containing Transmembrane Domain of the CCK4 Oncogene Does Not Encode Preferential Self-InteractionsBiochemistry
BiochemistryIF0
PREAI
分享收藏
查看更多内容