An empirical comparison of training algorithms for radial basis functions

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present a review and comparison of five different algorithms for training a RBF network. The algorithms are compared using nine databases. Our results show that the simplest algorithm, k-means clustering, may be the best alternative. The results of RBF are also compared with the results of Multilayer Feedforward with Backpropagation, the performance of a RBF network trained with k-means clustering is slightly better and the computational cost considerably lower. So we think that RBF may be a better alternative. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Ortiz-Gómez, M., Hernández-Espinosa, C., & Fernández-Redondo, M. (2003). An empirical comparison of training algorithms for radial basis functions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. https://doi.org/10.1007/3-540-44869-1_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free