Improved clustering and anisotropic gradient descent algorithm for compact RBF network

Authors:
Delu Zeng;Shengli Xie;Zhiheng Zhou
Affiliations:
College of Electronic & Information Engineering, South China University of Technology, Guangzhou, China;College of Electronic & Information Engineering, South China University of Technology, Guangzhou, China;College of Electronic & Information Engineering, South China University of Technology, Guangzhou, China
Venue:
ICONIP'06 Proceedings of the 13th international conference on Neural Information Processing - Volume Part II
Year:
2006

Citing 3
Cited 0

Regularization in the selection of radial basis function centers

Neural Computation
Effects of moving the center's in an RBF network

IEEE Transactions on Neural Networks
A generalized growing and pruning RBF (GGAP-RBF) neural network for function approximation

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the formulation of radial basis function (RBF) network, there are three factors mainly considered, i.e., centers, widths, and weights, which significantly affect the performance of the network. Within thus three factors, the placement of centers is proved theoretically and practically to be critical. In order to obtain a compact network, this paper presents an improved clustering (IC) scheme to obtain the location of the centers. What is more, since the location of the corresponding widths does affect the performance of the networks, a learning algorithms referred to as anisotropic gradient descent (AGD) method for designing the widths is presented as well. In the context of this paper, the conventional gradient descent method for learning the weights of the networks is combined with that of the widths to form an array of couple recursive equations. The implementation of the proposed algorithm shows that it is as efficient and practical as GGAP-RBF.