Abstract
In this paper, a new approach is proposed to reduce the complexity of radial basis function (RBF) networks. This approach starts with an enough number of hidden nodes and reduces the number of nodes in the course of learning. The algorithm can be employed in the problems where only the performance index of the network output is given, as well as in the supervised training problems where the desired output values are available. Also, it is applicable to either of classification problems and function approximation problems.
| Original language | English |
|---|---|
| Pages | 1308-1312 |
| Number of pages | 5 |
| Publication status | Published - Dec 1 1999 |
| Event | International Joint Conference on Neural Networks (IJCNN'99) - Washington, DC, USA Duration: Jul 10 1999 → Jul 16 1999 |
Other
| Other | International Joint Conference on Neural Networks (IJCNN'99) |
|---|---|
| City | Washington, DC, USA |
| Period | 7/10/99 → 7/16/99 |
All Science Journal Classification (ASJC) codes
- Software
- Artificial Intelligence