Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Sparse representation for kernel function selection of support vector machine

Sparse representation for kernel function selection of support vector machine Support vector machine (SVM) is a kind of learning method based on the kernel, and it is well known that different kernel functions have significant different influences on the performance of SVM. Thus, how to obtain an effective method for the kernel functions election becomes an important issue in the researching field of SVM. Since different kernel functions contain different geometric measurement characteristics, selecting an appropriate kernel function can results in satisfying generalisation ability of SVM. However, the traditional method for the SVM kernel function choice is manually designated, which contains great limitations and blindness, obviously. Based on sparse representation theory, this paper presents a kernel function selection method, which can take the measurement features of different kernel functions into account and make a reasonable choice of the kernel function of SVM according to specific problems. Finally, simulation experiments are given to show that the method in this paper can overcome the shortcomings of the traditional kernel function selection in SVM model, and achieve the optimal performance. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Autonomous and Adaptive Communications Systems Inderscience Publishers

Sparse representation for kernel function selection of support vector machine

Download PDF
15 pages

Loading next page...
 
/lp/inderscience-publishers/sparse-representation-for-kernel-function-selection-of-support-vector-Lcn48MdUPh
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd
ISSN
1754-8632
eISSN
1754-8640
DOI
10.1504/IJAACS.2018.090665
Publisher site
See Article on Publisher Site

Abstract

Support vector machine (SVM) is a kind of learning method based on the kernel, and it is well known that different kernel functions have significant different influences on the performance of SVM. Thus, how to obtain an effective method for the kernel functions election becomes an important issue in the researching field of SVM. Since different kernel functions contain different geometric measurement characteristics, selecting an appropriate kernel function can results in satisfying generalisation ability of SVM. However, the traditional method for the SVM kernel function choice is manually designated, which contains great limitations and blindness, obviously. Based on sparse representation theory, this paper presents a kernel function selection method, which can take the measurement features of different kernel functions into account and make a reasonable choice of the kernel function of SVM according to specific problems. Finally, simulation experiments are given to show that the method in this paper can overcome the shortcomings of the traditional kernel function selection in SVM model, and achieve the optimal performance.

Journal

International Journal of Autonomous and Adaptive Communications Systems – Inderscience Publishers

Published: Jan 1, 2018

There are no references for this article.