Sparse Bayesian modeling with adaptive kernel learning.
Sparse kernel methods are very efficient in solving regression and classification problems. The sparsity and performance of these methods depend on selecting an appropriate kernel function, which is typically achieved using a cross-validation procedure. In this paper, we propose an incremental method for supervised learning, which is similar to the relevance vector machine (RVM) but also learns the parameters of the kernels during model training. Specifically, we learn different parameter values for each kernel, resulting in a very flexible model. In order to avoid overfitting, we use a sparsity enforcing prior that controls the effective number of parameters of the model. We present experimental results on artificial data to demonstrate the advantages of the proposed method and we provide a comparison with the typical RVM on several commonly used regression and classification data sets.
Tzikas
Dimitris G
DG
Department of Computer Science, University of Ioannina, Ioannina 45110, Greece. tzikas@cs.uoi.gr
Likas
Aristidis C
AC
Galatsanos
Nikolaos P
NP
D000465:Algorithms; D001185:Artificial Intelligence; D001499:Bayes Theorem; D003198:Computer Simulation; D003627:Data Interpretation, Statistical; D008962:Models, Theoretical; D010363:Pattern Recognition, Automated / Q000379:methods*