.png){kind=icon}
返回
A generalized S-K algorithm for learning v-SVM classifiers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2004.03.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The S-K algorithm (Schlesinger-Kozinec algorithm) and the modified kernel technique due to Friess et al. have been recently combined to solve SVM with L-2 cost function. In this paper, we generalize S-K algorithm to be applied for soft convex hulls. As a result, our algorithm can solve v-SVM based on L-1 cost function. Simple in nature, our soft algorithm is essentially a algorithm for finding the epsilon-optimal nearest points between two soft convex hulls. As only the vertexes of the hard convex hulls are used, the obvious superiority of our algorithm is that it has almost the same computational cost as that of the hard S-K algorithm. The theoretical analysis and some experiments demonstrate the performance of our algorithm. (C) 2004 Elsevier B.V. All rights reserved.
Keyword:
statistical machine learning
support vector machines
classification
v-SVM
S-K algorithms
soft convex hulls
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容