In this paper we propose a novel evolutionary algorithm for regularization networks. The main drawback of regularization networks in practical applications is the presence of meta-parameters, including the type and parameters of kernel functions Our learning algorithm provides a solution to this problem by searching through a space of different kernel functions, including sum and composite kernels. Thus, an optimal combination of kernel functions with parameters is evolved for given task specified by training data. Comparisons of composite kernels, single kernels, and traditional Gaussians are provided in several experiments. © 2011 Springer-Verlag.
CITATION STYLE
Vidnerová, P., & Neruda, R. (2011). Evolving sum and composite kernel functions for regularization networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6593 LNCS, pp. 180–189). https://doi.org/10.1007/978-3-642-20282-7_19
Mendeley helps you to discover research relevant for your work.