This paper presents and evaluates one algorithm for incrementally constructing Radial Basis Function Networks, a class of neural networks which looks more suitable for adaptive control applications than the more popular backpropagation networks. The algorithm has been inspired by the CART algorithm developed by Breiman for generation regression trees. The algorithm proved to work well on a number of tests and exhibits performances comparable to the one step learning. An evaluation on the standard case study of the Mackey-Glass temporal series is reported.
An incremental algorithm for learning Radial Basis Function Networks
Blanzieri, Enrico;
1996-01-01
Abstract
This paper presents and evaluates one algorithm for incrementally constructing Radial Basis Function Networks, a class of neural networks which looks more suitable for adaptive control applications than the more popular backpropagation networks. The algorithm has been inspired by the CART algorithm developed by Breiman for generation regression trees. The algorithm proved to work well on a number of tests and exhibits performances comparable to the one step learning. An evaluation on the standard case study of the Mackey-Glass temporal series is reported.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione



