Name
Title | ||
|---|---|---|
Improved clustering and anisotropic gradient descent algorithm for compact RBF network |
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11893257_89 | ICONIP |
Keywords | Field | DocType |
anisotropic gradient descent,radial basis function,couple recursive equation,conventional gradient descent method,compact network,improved clustering,proposed algorithm,corresponding width,compact rbf network,anisotropic gradient descent algorithm,gradient descent,gradient descent method | Gradient method,Gradient descent,Anisotropy,Search algorithm,Radial basis function,Computer science,Algorithm,Artificial neural network,Cluster analysis,Recursion | Conference |
Volume | ISSN | ISBN |
4233 | 0302-9743 | 3-540-46481-6 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Delu Zeng | 1 | 164 | 11.46 |
| Shengli Xie | 2 | 2530 | 161.51 |
| Zhiheng Zhou | 3 | 43 | 23.53 |