.png){kind=icon}
返回
Candidate working set strategy based SMO algorithm in support vector machine
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ipm.2009.05.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sequential minimal optimization (SMO) is quite an efficient algorithm for training the support vector machine. The most important step of this algorithm is the selection of the working set, which greatly affects the training speed. The feasible direction strategy for the working set selection can decrease the objective function, however, may augment to the total calculation for selecting the working set in each of the iteration. In this paper, a new candidate working set (CWS) Strategy is presented considering the cost on the working set selection and cache performance. This new strategy can select several greatest violating samples from Cache as the iterative working sets for the next several optimizing steps, which can improve the efficiency of the kernel cache usage and reduce the computational cost related to the working set selection. The results of the theory analysis and experiments demonstrate that the proposed method can reduce the training time, especially on the large-scale datasets. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Support vector machine
SMO
Candidate working set strategy
Kernel cache
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
6.9
论文数:
5.2K
被引数:
1.4W
机构
引用论文
分享收藏Commentary: New Currents in Science: The Challenge of Quality, examining the discrepancies and incongruities between Japanese techno-scientific policy and the citizens’ science movement in post-3/11 Japan.png)
Futures
OAAI
FuturesIF0
OAAI分享收藏Text classification from unlabeled documents with bootstrapping and feature projection techniques
PREAI
分享收藏Physiology and tonotopic organization of auditory receptors in the cricketGryllus bimaculatus DeGeer
PREAI
分享收藏
查看更多内容