scholarly journals Prior-knowledge based Green's kernel for support vector regression

2021 ◽  
Author(s):  
Tahir Farooq
Keyword(s):  
Support Vector Regression ◽  
Prior Knowledge ◽  
Kernel Function ◽  
Real World ◽  
Matched Filter ◽  
Kernel Functions ◽  
Support Vector ◽  
Mathematical Framework ◽  
Knowledge Based ◽  
Model Complex

This thesis presents a novel prior knowledge based Green's kernel for support vector regression (SVR) and provides an empirical investigation of SVM's (support vector machines) ability to model complex real world problems using a real dataset. After reviewing the theoretical background such as theory SVM, the correspondence between kernels functions used in SVM and regularization operators used in regularization networks as well as the use of Green's function of their corresponding regularization operators to construct kernel functions for SVM, a mathematical framework is presented to obtain the domain knowledge about the magnitude of the Fourier transform of the function to be predicted and design a prior knowledge based Green's kernel that exhibits optimal regularization properties by using the concept of matched filters. The matched filter behavior of the proposed kernel function provides the optimal regularization and also makes it suitable for signals corrupted with noise that includes many real world systems. Several experiments, mostly using benchmark datasets ranging from simple regression models to non-linear and high dimensional chaotic time series, have been conducted in order to compare the performance of the proposed technique with the results already published in the literature for other existing support vector kernels over a variety of settings including different noise levels, noise models, loss functions and SVM variations. The proposed kernel function improves the best known results by 18.6% and 24.4% on a benchmark dataset for two different experimental settings.

scholarly journals Prior-knowledge based Green's kernel for support vector regression

2021 ◽  
Author(s):  
Tahir Farooq
Keyword(s):  
Support Vector Regression ◽  
Prior Knowledge ◽  
Kernel Function ◽  
Real World ◽  
Matched Filter ◽  
Kernel Functions ◽  
Support Vector ◽  
Mathematical Framework ◽  
Knowledge Based ◽  
Model Complex

This thesis presents a novel prior knowledge based Green's kernel for support vector regression (SVR) and provides an empirical investigation of SVM's (support vector machines) ability to model complex real world problems using a real dataset. After reviewing the theoretical background such as theory SVM, the correspondence between kernels functions used in SVM and regularization operators used in regularization networks as well as the use of Green's function of their corresponding regularization operators to construct kernel functions for SVM, a mathematical framework is presented to obtain the domain knowledge about the magnitude of the Fourier transform of the function to be predicted and design a prior knowledge based Green's kernel that exhibits optimal regularization properties by using the concept of matched filters. The matched filter behavior of the proposed kernel function provides the optimal regularization and also makes it suitable for signals corrupted with noise that includes many real world systems. Several experiments, mostly using benchmark datasets ranging from simple regression models to non-linear and high dimensional chaotic time series, have been conducted in order to compare the performance of the proposed technique with the results already published in the literature for other existing support vector kernels over a variety of settings including different noise levels, noise models, loss functions and SVM variations. The proposed kernel function improves the best known results by 18.6% and 24.4% on a benchmark dataset for two different experimental settings.

scholarly journals Knowledge-Based Green's Kernel for Support Vector Regression

2010 ◽  
Vol 2010 ◽  
pp. 1-16 ◽  
Author(s):  
Tahir Farooq ◽  
Aziz Guergachi ◽  
Sridhar Krishnan
Keyword(s):  
Support Vector Regression ◽  
Prior Knowledge ◽  
Domain Knowledge ◽  
Matched Filter ◽  
Good Choice ◽  
Kernel Functions ◽  
Support Vector ◽  
Mathematical Framework ◽  
Knowledge Based ◽  
Benchmark Datasets

This paper presents a novel prior knowledge-based Green's kernel for support vector regression (SVR). After reviewing the correspondence between support vector kernels used in support vector machines (SVMs) and regularization operators used in regularization networks and the use of Green's function of their corresponding regularization operators to construct support vector kernels, a mathematical framework is presented to obtain the domain knowledge about magnitude of the Fourier transform of the function to be predicted and design a prior knowledge-based Green's kernel that exhibits optimal regularization properties by using the concept of matched filters. The matched filter behavior of the proposed kernel function makes it suitable for signals corrupted with noise that includes many real world systems. We conduct several experiments mostly using benchmark datasets to compare the performance of our proposed technique with the results already published in literature for other existing support vector kernel over a variety of settings including different noise levels, noise models, loss functions, and SVM variations. Experimental results indicate that knowledge-based Green's kernel could be seen as a good choice among the other candidate kernel functions.

Support Vector Regression Modeling for LTCC Interconnection Based on Prior Knowledge

2012 ◽  
Vol 2012 (CICMT) ◽  
pp. 000621-000626
Author(s):  
Lei Xia ◽  
Ruimin Xu ◽  
Bo Yan
Keyword(s):  
Low Temperature ◽  
Support Vector Regression ◽  
Prior Knowledge ◽  
Predictive Ability ◽  
Regression Modeling ◽  
Experimental Results ◽  
Support Vector ◽  
Knowledge Based ◽  
Vertical Interconnection ◽  
Rf Performance

This paper presents a prior knowledge based support vector regression modeling method to characterize the RF performance of the low temperature co-fired ceramic (LTCC) structure. A coarse surrogate is formed by multidimensional Cauchy approximation as the prior knowledge to improve the accuracy of modeling. 3D LTCC based vertical interconnection model is developed as an example using the proposed method. Experimental results show that the developed SVR model perform a better predictive ability.

scholarly journals A Kernel-Based Approach for Biomedical Named Entity Recognition

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Rakesh Patra ◽  
Sujan Kumar Saha
Keyword(s):  
Kernel Function ◽  
Text Processing ◽  
Named Entity Recognition ◽  
Kernel Functions ◽  
Entity Recognition ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
Svm Classifier ◽  
Named Entity ◽  
Tree Kernel

Support vector machine (SVM) is one of the popular machine learning techniques used in various text processing tasks including named entity recognition (NER). The performance of the SVM classifier largely depends on the appropriateness of the kernel function. In the last few years a number of task-specific kernel functions have been proposed and used in various text processing tasks, for example, string kernel, graph kernel, tree kernel and so on. So far very few efforts have been devoted to the development of NER task specific kernel. In the literature we found that the tree kernel has been used in NER task only for entity boundary detection or reannotation. The conventional tree kernel is unable to execute the complete NER task on its own. In this paper we have proposed a kernel function, motivated by the tree kernel, which is able to perform the complete NER task. To examine the effectiveness of the proposed kernel, we have applied the kernel function on the openly available JNLPBA 2004 data. Our kernel executes the complete NER task and achieves reasonable accuracy.

scholarly journals A COMPARISON STUDY OF DIFFERENT KERNEL FUNCTIONS FOR SVM-BASED CLASSIFICATION OF MULTI-TEMPORAL POLARIMETRY SAR DATA

2014 ◽  
Vol XL-2/W3 ◽  
pp. 281-285 ◽  
Author(s):  
B. Yekkehkhany ◽  
A. Safari ◽  
S. Homayouni ◽  
M. Hasanlou
Keyword(s):  
Kernel Function ◽  
Temporal Integration ◽  
Experimental Tests ◽  
Kernel Functions ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Svm Classifier ◽  
Rbf Kernel ◽  
Multi Temporal ◽  
Dimension Space

In this paper, a framework is developed based on Support Vector Machines (SVM) for crop classification using polarimetric features extracted from multi-temporal Synthetic Aperture Radar (SAR) imageries. The multi-temporal integration of data not only improves the overall retrieval accuracy but also provides more reliable estimates with respect to single-date data. Several kernel functions are employed and compared in this study for mapping the input space to higher Hilbert dimension space. These kernel functions include linear, polynomials and Radial Based Function (RBF). <br><br> The method is applied to several UAVSAR L-band SAR images acquired over an agricultural area near Winnipeg, Manitoba, Canada. In this research, the temporal alpha features of H/A/α decomposition method are used in classification. The experimental tests show an SVM classifier with RBF kernel for three dates of data increases the Overall Accuracy (OA) to up to 3% in comparison to using linear kernel function, and up to 1% in comparison to a 3rd degree polynomial kernel function.

Research of a New SVM Kernel Function

2014 ◽  
Vol 543-547 ◽  
pp. 1659-1662
Author(s):  
Juan Du ◽  
Wen Long Zhang ◽  
Meng Meng Xie
Keyword(s):  
Kernel Function ◽  
Homogeneous Polynomial ◽  
Information Filtering ◽  
Kernel Functions ◽  
Learning Ability ◽  
New Combination ◽  
Polynomial Kernel ◽  
Support Vector ◽  
Text Information ◽  
Information Recognition

The kernel was the key technology of SVM; the kernel affected the learning ability and generalization ability of support vector machine. Aiming at the specific application of harmful text information recognition, combining traditional kernel function the paper structured a new combination kernel, modeling for the independent harmful vocabulary and co-occur vocabularies, and then evaluation the linear kernel, homogeneous polynomial kernel, non homogeneous polynomial kernel and combination kernel function in the sample experiment. The experimental results of combination kernel function showed that the effect has increased greatly than other kernel functions for the application of harmful text information filtering. Especially the Rcall value achieved satisfactory results.

Sign in / Sign up

Export Citation Format

Share Document