65 search results - page 7 / 13 » Multi-Objective Programming in SVMs |
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
There has been a considerable body of work on search–based test data generation for branch coverage. However, hitherto, there has been no work on multi–objective branch covera...
GECCO
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. Bloat control is an important aspect of evolutionary computation methods, such as genetic programming, which must deal with genomes of arbitrary size. We introduce three ...
ECML
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
— In this paper, we show that one-class SVMs can also utilize data covariance in a robust manner to improve performance. Furthermore, by constraining the desired kernel function ...
IJCNN
2000
IEEE
13 years 12 months ago
2000
IEEE
The main purpose of this paper is to compare the support vector machine (SVM) developed by Vapnik with other techniques such as Backpropagation and Radial Basis Function (RBF) Net...