Welcome to the InfoSci Platform
Reference Hub10
Kernal Width Selection for SVM Classification: A Meta-Learning Approach

Kernal Width Selection for SVM Classification: A Meta-Learning Approach

Shawkat Ali, Kate A. Smith
Copyright: © 2005 |Volume: 1 |Issue: 4 |Pages: 20
ISSN: 1548-3924|EISSN: 1548-3932|ISSN: 1548-3924|EISBN13: 9781615202140|EISSN: 1548-3924|DOI: 10.4018/jdwm.2005100104
Cite Article Cite Article

MLA

Ali, Shawkat, and Kate A. Smith. "Kernal Width Selection for SVM Classification: A Meta-Learning Approach." IJDWM vol.1, no.4 2005: pp.78-97. http://doi.org/10.4018/jdwm.2005100104

APA

Ali, S. & Smith, K. A. (2005). Kernal Width Selection for SVM Classification: A Meta-Learning Approach. International Journal of Data Warehousing and Mining (IJDWM), 1(4), 78-97. http://doi.org/10.4018/jdwm.2005100104

Chicago

Ali, Shawkat, and Kate A. Smith. "Kernal Width Selection for SVM Classification: A Meta-Learning Approach," International Journal of Data Warehousing and Mining (IJDWM) 1, no.4: 78-97. http://doi.org/10.4018/jdwm.2005100104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The most critical component of kernel-based learning algorithms is the choice of an appropriate kernel and its optimal parameters. In this paper, we propose a rule-based meta-learning approach for automatic radial basis function (RBF) kernel and its parameter selection for Support Vector Machine (SVM) classification. First, the best parameter selection is considered on the basis of prior information of the data with the help of Maximum Likelihood (ML) method and Nelder-Mead (N-M) simplex method. Then, the new rule-based meta-learning approach is constructed and tested on different sizes of 112 datasets with binary class as well as multi-class classification problems. We observe that our rule-based methodology provides significant improvement of computational time as well as accuracy in some specific cases.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.