.png){kind=icon}
返回
The Proximal Trajectory Algorithm in SVM Cross Validation
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2015.2430935.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a bilevel cross-validation scheme for support vector machine (SVM) model selection based on the construction of the entire regularization path. Since such path is a particular case of the more general proximal trajectory concept from nonsmooth optimization, we propose for its construction an algorithm based on solving a finite number of structured linear programs. Our methodology, differently from other approaches, works directly on the primal form of SVM. Numerical results are presented on binary data sets drawn from literature.
Keyword:
Cross validation (CV)
model selection
nonsmooth optimization
proximal trajectory
regularization path
support vector machine (SVM)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Water Use Patterns of Sympatric Przewalski’s Horse and Khulan: Interspecific Comparison Reveals Niche Differences.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏
分享收藏A partially inexact bundle method for convex semi-infinite minmax problems凸半无限minmax问题的部分不精确束方法
PREAI
分享收藏
查看更多内容