.png){kind=icon}
返回
Feasible direction decomposition algorithms for training support vector machines
.png){kind=icon}
OA
AI
DOI：10.1023/A:1012479116909.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The article presents a general view of a class of decomposition algorithms for training Support Vector Machines (SVM) which are motivated by the method of feasible directions. The first such algorithm for the pattern recognition SVM has been proposed in Joachims, T. (1999, Scholkopf et al. (Eds.) Advances in kernel methods-Support vector learning (pp. 185-208). MIT Press). Its extension to the regression SVM-the maximal inconsistency algorithm-has been recently presented by the author (Laskov, 2000, Solla, Leen, & Muller (Eds.) Advances in neural information processing systems 12 (pp. 484-490). MIT Press). A detailed account of both algorithms is carried out, complemented by theoretical investigation of the relationship between the two algorithms. It is proved that the two algorithms are equivalent for the pattern recognition SVM, and the feasible direction interpretation of the maximal inconsistency algorithm is given for the regression SVM. The experimental results demonstrate an order of magnitude decrease of training time in comparison with training without decomposition, and, most importantly, provide experimental evidence of the linear convergence rate of the feasible direction decomposition algorithms.
Keyword:
support vector machines
training
decomposition algorithms
methods of feasible directions
working set selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
