Name
Abstract | ||
|---|---|---|
Recently, evolving multiple kernel learning methods have attracted researchers' attention due to the ability to find the composite kernel with the optimal mapping model in a large high-dimensional feature space. However, it is not suitable to compute the composite kernel in a stationary way for all samples. In this paper, we propose a method of evolving non-stationary multiple kernel learning, in which base kernels are encoded as tree kernels and a gating function is used to determine the weights of the tree kernels simultaneously. Obtained classifiers have the composite kernel with the optimal mapping model and select the most appropriate combined weights according to the input samples. Experimental results on several UCI datasets illustrate the validity of proposed method. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-12640-1_3 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Genetic programming,non-stationary multiple kernel learning,composite kernel,gating function | Pattern recognition,Radial basis function kernel,Computer science,Kernel embedding of distributions,Multiple kernel learning,Kernel principal component analysis,Tree kernel,Polynomial kernel,Artificial intelligence,String kernel,Variable kernel density estimation,Machine learning | Conference |
Volume | ISSN | Citations |
8835 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |