Copyright © 2006 Elsevier B.V. All rights reserved.
Letters
Improved pruning strategy for radial basis function networks with dynamic decay adjustment
Received 19 October 2005;
revised 20 December 2005;
accepted 5 January 2006.
Communicated by R.W. Newcomb.
Available online 15 May 2006.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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.
Keywords: RBF network; Classification; Dynamic decay adjustment; Pruning






E-mail Article
Add to my Quick Links

Cited By in Scopus (1)






