Abstract
Clustering algorithms have been applied in several disciplines successfully. One of those applications is the initialization of Radial Basis Functions (RBF) centers composing a Neural Network, designed to solve functional approximation problems. The Clustering for Function Approximation (CFA) algorithm was presented as a new clustering technique that provides better results than other clustering algorithms that were traditionally used to initialize RBF centers. Even though CFA improves performance against other clustering algorithms, it has some flaws that can be improved. Within those flaws, it can be mentioned the way the partition of the input data is done, the complex migration process, the algorithm’s speed, the existence of some parameters that have to be set in order to obtain good solutions, and the convergence is not guaranteed. In this paper, it is proposed an improved version of this algorithm that solves the problems that its predecessor has using fuzzy logic successfully. In the experiments section, it will be shown how the new algorithm performs better than its predecessor and how important is to make a correct initialization of the RBF centers to obtain small approximation errors.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum, Nueva York (1981)
Bors., A.G.: Introduction of the Radial Basis Function (RBF) networks. OnLine Symposium for Electronics Engineers
Duda, R.O., Hart, P.E.: Pattern classification and scene analysis. Wiley, New York (1973)
Gersho, A.: Asymptotically Optimal Block Quantization. IEEE Transanctions on Information Theory 25(4), 373–380 (1979)
González, J., Rojas, I., Pomares, H., Ortega, J., Prieto, A.: A new Clustering Technique for Function Aproximation. IEEE Transactions on Neural Networks 13(1), 132–142 (2002)
Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)
Prieto, A., Rojas, I., Anguita, M., Valenzuela, O.: Analysis of the operators involved in the definition of the implication functions and in the fuzzy inference proccess. Int. J. Approximate Reasoning 19, 367–389 (1998)
Karayannis, N.B., Mi, G.W.: Growing radial basis neural networks: Merging supervised and unsupervised learning with network growth techniques
Park, J., Sandberg, J.W.: Universal approximation using radial basis functions network. Neural Computation 3, 246–257 (1991)
Cai, Y., Zhu, Q., Liu, L.: A global learning algorithm for a RBF network
Russo, M., Patané, G.: Improving the LBG Algorithm. In: Mira, J. (ed.) IWANN 1999. LNCS, vol. 1606, pp. 621–630. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guillén, A. et al. (2005). Improving Clustering Technique for Functional Approximation Problem Using Fuzzy Logic: ICFA Algorithm. In: Cabestany, J., Prieto, A., Sandoval, F. (eds) Computational Intelligence and Bioinspired Systems. IWANN 2005. Lecture Notes in Computer Science, vol 3512. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494669_34
Download citation
DOI: https://doi.org/10.1007/11494669_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26208-4
Online ISBN: 978-3-540-32106-4
eBook Packages: Computer ScienceComputer Science (R0)