返回
A nested heuristic for parameter tuning in Support Vector Machines
DOI:10.1016/j.cor.2013.10.002.png)
摘要
En 中文
The default approach for tuning the parameters of a Support Vector Machine (SVM) is a grid search in the parameter space. Different metaheuristics have been recently proposed as a more efficient alternative, but they have only shown to be useful in models with a low number of parameters. Complex models, involving many parameters, can be seen as extensions of simpler and easy-to-tune models, yielding a nested sequence of models of increasing complexity. In this paper we propose an algorithm which successfully exploits this nested property, with two main advantages versus the state of the art. First, our framework is general enough to allow one to address, with the very same method, several popular SVM parameter models encountered in the literature. Second, as algorithmic requirements we only need either an SVM library or any routine for the minimization of convex quadratic functions under linear constraints. In the computational study, we address Multiple Kernel Learning tuning problems for which grid search clearly would be infeasible, while our classification accuracy is comparable to that of ad hoc model-dependent benchmark tuning methods. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Supervised classification
Support Vector Machines
Parameter tuning
Nested heuristic
Variable neighborhood search
Multiple kernel learning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search用禁忌搜索和变邻域搜索解决扩频雷达多相码设计问题
Tube Feeding Practices and Transition to Breastfeeding Experiences of Mothers of Preterm Infants at a Kangaroo Mother Care Unit of a Tertiary Hospital in South Africa早产儿母亲的管饲喂养实践与在南非一家三级医院 Kangaroo Mother Care Unit 中向母乳喂养过渡的体验

