.png){kind=icon}
返回
Linear programming support vector machines
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(01)00210-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Based on the analysis of the conclusions in the statistical learning theory, especially the VC dimension of linear functions linear programming support vector machines (or SVMs) are presented including linear programming linear and nonlinear SVMs. In linear programming SVMs, in order to improve the speed of the training time, the bound of the VC dimension is loosened properly. Simulation results for both artificial and real data show that the generalization performance of our method is a good approximation of SVMs and the computation complex is largely reduced by our method. (C) 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Keyword:
statistical learning theory
VC dimension
support vector machines
generalization performance
linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏Phenotypic Heterogeneity in Two Unrelated Danon Patients Associated with the SameLAMP‐2Gene Mutation
PREAI
分享收藏 没有更多内容
没有更多内容