.png){kind=icon}
返回
Sparse kernel SVMs via cutting-plane training
.png){kind=icon}
PRE
AI
DOI：10.1007/s10994-009-5126-6.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We explore an algorithm for training SVMs with Kernels that can represent the learned rule using arbitrary basis vectors, not just the support vectors (SVs) from the training set. This results in two benefits. First, the added flexibility makes it possible to find sparser solutions of good quality, substantially speeding-up prediction. Second, the improved sparsity can also make training of Kernel SVMs more efficient, especially for high-dimensional and sparse data (e.g. text classification). This has the potential to make training of Kernel SVMs tractable for large training sets, where conventional methods scale quadratically due to the linear growth of the number of SVs. In addition to a theoretical analysis of the algorithm, we also present an empirical evaluation.
Keyword:
Support vector machines
Kernel methods
Sparse kernel methods
Cutting plane algorithm
Basis pursuit
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
Solution structure of 5-keto-D-fructose: relevance to the specificity of hexose kinases.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏
分享收藏
没有更多内容
没有更多内容