Letters: Improved pruning strategy for radial basis function networks with dynamic decay adjustment

Authors:
Elisa Ricci;Renzo Perfetti
Affiliations:
Department of Electronic and Information Engineering, University of Perugia, via G. Duranti 93, 06125 Perugia, Italy;Department of Electronic and Information Engineering, University of Perugia, via G. Duranti 93, 06125 Perugia, Italy
Venue:
Neurocomputing
Year:
2006

Citing 2
Cited 3

Improving RBF-DDA Performance on Optical Character Recognition through Parameter Selection

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 4 - Volume 04
Letter: Improving constructive training of RBF networks through selective pruning and model selection

Neurocomputing

Letters: Novelty detection with constructive probabilistic neural networks

Neurocomputing
Automatic generation of the optimum threshold for parameter weighted pruning in multiple heterogeneous output neural networks

Neurocomputing
Particle swarm optimization for construction of neural network-based prediction intervals

Neurocomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

Dynamic decay adjustment (DDA) is a fast algorithm to construct radial basis function (RBF) networks for classification problems. It is known that, despite its interesting features, DDA produces classifiers with high complexity, especially for large datasets. In this Letter a simple method to overcome this problem is proposed, which eliminates redundant units improving generalization. Experimental results on benchmark datasets show the good performance of our approach compared to previous methods.