Kernels Sigmoid

Support Vector Machine (SVM) is a classification and regression method developed by Vapnik.30 In support vector regression (SVR), the input variables are first mapped into a higher dimensional feature space by the use of a kernel function, and then a linear model is constructed in this feature space. The kernel functions often used in SVM include linear, polynomial, radial basis function (RBF), and sigmoid function. The generalization performance of SVM depends on the selection of several internal parameters of the algorithm (C and e), the type of kernel, and the parameters of the kernel.31... 

Because the relaxation spectra are similar for transient and dynamic relaxation viscoelastic functions, H t) can also be obtained from the storage relaxation modulus. The plot of the kernel of the integral of Eq. (9.8), x /(l + (o x ), versus logcax is a sigmoidal curve that intercepts the ordinate axis at 0.5 and reaches the value of 1 in the limit cox oo (see Fig. 9.5). The kernel can be approximated by the step function... 

The Gaussian kernel is used in potential function classifiers, also known as radial basis function networks. A sigmoid kernel implements a multilayer perceptron (cf. Section 8.2) with a single hidden layer. 

Linear kernel Polynomial of degree d Radial base function Sigmoid function ... 

Along with CT and LM, we want to test ANN and SVM for classification of mass spectra. The selection of descriptors for constructing the tree is performed with the CART algorithm. Due to the intrinsic rapidity of MLR, many descriptor subsets are tested within a reasonable time and good ones are selected. For ANN and SVM such opportunities are not available. Nevertheless, in order to use these methods, we calculate ANN and SVM for the descriptor subsets determined by CT and MLR. Thus, we test ANNs of one, two, and three hidden neurons, and SVMs with linear, radial, polynomial (degree = 2), and sigmoid kernel along with CT (mindev = 0.04) and LDA for the 77 structural properties. 

Among the 1790 substructures there are 301 for which such sets can be obtained. For each of these 301 substructures we calculate MS classifiers. For descriptor selection we use, as described above, the 50 -fold stepwise procedure within MLR. By so doing we obtain 13 MS descriptors relevant for modeling for each substructure. For classification CT, LDA, ANN with one, two, or three HN, and SVM with linear, radial, polynomial (degree = 2), and sigmoid kernel are used. 

A logical sum of Condition I o Condition II n Condition III] results in a kernel containing the concentration sum of all components. The sum kernel inspired by sigmoidal function which allows a rapid change at a threshold point but continuously is ... 

Considering the CS2 example, several assays were made considering four different kernels linear, polynomial (with different degrees), radial basis functions (RBF) and a sigmoid type. The RMSEC and the RMSEP errors for calibration and validation were considered in order to select a model and a satisfactory trade-off searched for. As expected, some good fits yielded nonuseful predictions for the unknowns. 

Since the prediction ability of support vector machine is dependent on the selection of kernels and the parameter C. The rate of correctness of computerized prediction tested by LOO cross-validation method has been used as the criterion of the optimization of method of SVC computation. Four kinds of kernels (linear kernel, polynomial kernel of second degree, Gaussian kernel and sigmoid kernel functions) with 10[Pg.269]

Lin, H. T. and Lin, C. J. (2003). A Study on Sigmoid kernels for SVM and the Training of Non-PSD Kernels by SMO-type Methods, Technical Report, Department of Computer Science and Information Engineering, National Taiwan University. 

The hyperbolic tangent (tanh) function, with a sigmoid shape, is the most used transfer function for artificial neural networks. The corresponding kernel has the formula ... 

SVMsequel, http //www.isi.edu/ hdaume/SVMsequel/. SVMsequel, by Daume III, is an SVM multiclass classification package, distributed as C source or as binaries for Linux or Solaris. Kernels available include linear, polynomial, radial basis function, sigmoid, string, tree, and information diffusion on discrete manifolds. 

---