Automatic model selection for the optimization of SVM kernels
β Scribed by N.E. Ayat; M. Cheriet; C.Y. Suen
- Publisher
- Elsevier Science
- Year
- 2005
- Tongue
- English
- Weight
- 349 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
β¦ Synopsis
This approach aims to optimize the kernel parameters and to efficiently reduce the number of support vectors, so that the generalization error can be reduced drastically. The proposed methodology suggests the use of a new model selection criterion based on the estimation of the probability of error of the SVM classifier. For comparison, we considered two more model selection criteria: GACV ('Generalized Approximate Cross-Validation') and VC ('Vapnik-Chernovenkis') dimension. These criteria are algebraic estimates of upper bounds of the expected error. For the former, we also propose a new minimization scheme. The experiments conducted on a bi-class problem show that we can adequately choose the SVM hyper-parameters using the empirical error criterion. Moreover, it turns out that the criterion produces a less complex model with fewer support vectors. For multi-class data, the optimization strategy is adapted to the one-against-one data partitioning. The approach is then evaluated on images of handwritten digits from the USPS database.
π SIMILAR VOLUMES
With mild restrictions placed on the kernel, kernel estimates of an unknown multivariatc density are investigated when the observed data are dependent. A modified cross validation rule, the simple 'leave-(2P + 1)-o&' version of simple cross validation, is considered for bandwidth selection. Under th
A new approach to automatic contingency selection (ACS) and ranking is presented in this paper. ACS for the P and Q subproblems is solved by a unified network flow model and algorithm. It is based on the existence of weak coupling between real and reactive quantities in power systems. The performanc
A controlled system and the differential inclusion corresponding to it, which function in a finite time interval and are restricted by a phase constraint in the form of a compact set in position space, are considered. A trial algorithm for the approximate construction of the viability kernel of the
Three variables characterizing the mobile phase composition, pH, elution strength and ionic strength, have been studied in order to construct a three-dimensional semiempirical model for predicting retention times of dibasic substances. The solutes treated quantitatively include dibasic acids and bas