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

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A variety of clustering algorithms have been applied to determine the internal structure of Radial Basis Function Neural Networks (RBFNNs). k-means algorithm is one of the most common choice for this task, although, like many other clustering algorithms, it needs to receive the number of prototypes a priori. This is a nontrivial procedure, mainly for real-world applications. An alternative is to use algorithms that automatically determine the number of prototypes. In this paper, we performed a multiobjective analysis involving three of these algorithms, which are: Adaptive Radius Immune Algorithm (ARIA), Affinity Propagation (AP), and Growing Neural Gas (GNG). For each one, the parameters that most influence the resulting number of prototypes composed the decision space, while the RBFNN RMSE and the number of prototypes formed the objective space. The experiments found that ARIA solutions achieved the best results for the multiobjective metrics adopted in this paper. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Veroneze, R., Gonçalves, A. R., & Von Zuben, F. J. (2012). A multiobjective analysis of adaptive clustering algorithms for the definition of RBF neural network centers in regression problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7435 LNCS, pp. 127–134). https://doi.org/10.1007/978-3-642-32639-4_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free