Studying possibility in a clustering algorithm for RBFNN design for function approximation

Authors:
A. Guillén;H. Pomares;I. Rojas;J. González;L. J. Herrera;F. Rojas;O. Valenzuela
Affiliations:
University of Jaán, Departament of Informatics, 23071, Jaán, Spain;University of Granada, Departament of Architecture and Computer Technology, 18071, Granada, Spain;University of Granada, Departament of Architecture and Computer Technology, 18071, Granada, Spain;University of Granada, Departament of Architecture and Computer Technology, 18071, Granada, Spain;University of Granada, Departament of Architecture and Computer Technology, 18071, Granada, Spain;University of Granada, Departament of Architecture and Computer Technology, 18071, Granada, Spain;University of Granada, Departament of Architecture and Computer Technology, 18071, Granada, Spain
Venue:
Neural Computing and Applications
Year:
2007

Citing 0
Cited 5

Parallel multiobjective memetic RBFNNs design and feature selection for function approximation problems

Neurocomputing
Applying multiobjective RBFNNs optimization and feature selection to a mineral reduction problem

Expert Systems with Applications: An International Journal
New method for instance or prototype selection using mutual information in time series prediction

Neurocomputing
A multiobjective analysis of adaptive clustering algorithms for the definition of RBF neural network centers in regression problems

IDEAL'12 Proceedings of the 13th international conference on Intelligent Data Engineering and Automated Learning
The influence of supervised clustering for RBFNN centers definition: a comparative study

ICANN'12 Proceedings of the 22nd international conference on Artificial Neural Networks and Machine Learning - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The function approximation problem has been tackled many times in the literature by using radial basis function neural networks (RBFNNs). In the design of these neural networks there are several stages where, the most critical stage is the initialization of the centers of each RBF since the rest of the steps to design the RBFNN strongly depend on it. The improved clustering for function approximation (ICFA) algorithm was recently introduced and proved successful for the function approximation problem. In the ICFA algorithm, a fuzzy partition of the input data is performed but, a fuzzy partition can behave inadequately in noise conditions. Possibilistic and mixed approaches, combining fuzzy and possibilistic partitions, were developed in order to improve the performance of a fuzzy partition. In this paper, a study of the influence of replacing the fuzzy partition used in the ICFA algorithm with the possibilistic and the fuzzy-possibilistic partitions will be done. A comparative analysis of each kind of partition will be performed in order to see if the possibilistic approach can improve the performance of the ICFA algorithm both in normal and in noise conditions. The results will show how the employment of a mixed approach combining fuzzy and possibilistic approach can lead to improve the results when designing RBFNNs.