Approximating I/O data using radial basis functions: A new clustering-based approach

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

Abstract

In this paper, we deal with the problem of function approximation from a given set of input/output data. This problem consists of analyzing these training examples so that we can predict the output of the model given new inputs. We present a new method for function approximation of the I/O data using radial basis functions (RBFs). This approach is based on a new efficient method of clustering of the centres of the RBF Network (RBFN); it uses the objective output of the RBFN to move the clusters instead of just the input values of the I/O data. This method of clustering, especially designed for function approximation problems, improves the performance of the approximator system obtained, compared with other models derived from traditional algorithms. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Awad, M., Pomares, H., Herrera, L. J., González, J., Guillén, A., & Rojas, F. (2005). Approximating I/O data using radial basis functions: A new clustering-based approach. In Lecture Notes in Computer Science (Vol. 3512, pp. 289–296). Springer Verlag. https://doi.org/10.1007/11494669_36

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