A fast robust learning algorithm for RBF network against outliers

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

Abstract

Training data set often contains outliers, which can cause substantial deterioration of the approximation realized by a neural network. In this paper, a fast robust learning algorithm against outliers for RBF network is presented. The algorithm uses the subtractive clustering(SC) method to select hidden node centers of RBF network, and the gradient descent method with the scaled robust loss function(SRLF) as the objective function to adjust hidden node widths and the connection weights of the network. Therefore, the learning of RBF network has robustness on dealing with outliers and fast rate of convergence. The experimental results show the advantages of the learning algorithm over traditional learning algorithms for RBF network. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Su, M. J., & Deng, W. (2006). A fast robust learning algorithm for RBF network against outliers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4113 LNCS-I, pp. 280–285). Springer Verlag. https://doi.org/10.1007/11816157_28

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