4.7 Article

A dynamic model selection strategy for support vector machine classifiers

期刊

APPLIED SOFT COMPUTING
卷 12, 期 8, 页码 2550-2565

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2012.04.001

关键词

Support Vector Machines; Model selection; Particle Swarm Optimization; Dynamic optimization

资金

  1. Defense Research and Development Canada, DRDC-Valcartier [W7701-2-4425]
  2. NSERC of Canada [OGP0106456]

向作者/读者索取更多资源

The Support Vector Machine (SVM) is a very powerful technique for general pattern recognition purposes but its efficiency in practice relies on the optimal selection of hyper-parameters. A naive or ad hoc choice of values for these can lead to poor performance in terms of generalization error and high complexity of the parameterized models obtained in terms of the number of support vectors identified. The task of searching for optimal hyper-parameters with respect to the aforementioned performance measures is the so-called SVM model selection problem. In this paper we propose a strategy to select optimal SVM models in a dynamic fashion in order to address this problem when knowledge about the environment is updated with new observations and previously parameterized models need to be re-evaluated, and in some cases discarded in favor of revised models. This strategy combines the power of swarm intelligence theory with the conventional grid search method in order to progressively identify and sort out potential solutions using dynamically updated training datasets. Experimental results demonstrate that the proposed method outperforms the traditional approaches tested against it, while saving considerable computational time. (C) 2012 Elsevier B. V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据