The Variant of Gaussian Kernel and Its Model Selection Method
Shuisheng Zhou, Hongwei Liu, Feng Ye
Abstract
Shuisheng Zhou, Hongwei Liu, Feng Ye
Abstract
The classification problem by nonlinear support vector machine with kernel function is discussed in this paper. The stretching ratio is defined in order to analyze the performance of the kernel function. A new type of kernel function is introduced by modifying the Gaussian kernel, and it has many properties as good as or better than Gaussian function. For example, the map of the new kernel function magnifies the distance between vectors in local because the stretching ratio is always larger than one without enlarging the radius of the circumscribed hypersphere that includes the whole mapping vectors in feature space, which gets the bigger margin. Two criterions are proposed to choose a good spread parameter for a given kernel function approximately but easily. Some experiments are given to compare the classification performances between the proposed kernel function and Gaussian kernel function.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The classification problem by nonlinear support vector machine with kernel function is discussed in this paper. The stretching ratio is defined in order to analyze the performance of the kernel function. A new type of kernel function is introduced by modifying the Gaussian kernel, and it has many properties as good as or better than Gaussian function. For example, the map of the new kernel function magnifies the distance between vectors in local because the stretching ratio is always larger than one without enlarging the radius of the circumscribed hypersphere that includes the whole mapping vectors in feature space, which gets the bigger margin. Two criterions are proposed to choose a good spread parameter for a given kernel function approximately but easily. Some experiments are given to compare the classification performances between the proposed kernel function and Gaussian kernel function.
Key concepts: Gaussian function, Radial basis function kernel, Kernel (algebra), Kernel embedding of distributions, Variable kernel density estimation, Kernel method, Polynomial kernel, Kernel principal component analysis