Regularization theory presents a sound framework to solving supervised learning problems. However, there is a gap between the theoretical results and practical suitability of regularization networks (RN). Radial basis function networks (RBF) can be seen as a special case of regularization networks with a selection of learning algorithms. We study a relationship between RN and RBF, and experimentally evaluate their approximation and generalization ability with respect to number of hidden units. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Vidnerová, P., & Neruda, R. (2008). Testing error estimates for regularization and radial function networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5263 LNCS, pp. 549–554). Springer Verlag. https://doi.org/10.1007/978-3-540-87732-5_61
Mendeley helps you to discover research relevant for your work.