Minimal RBF networks by Gaussian mixture model

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

Abstract

Radial basis function (RBF) networks have been successfully applied to function interpolation and classification problems among others. In this paper, we propose a basis function optimization method using a mixture density model. We generalize the Gaussian radial basis functions to arbitrary covariance matrices, in order to fully utilize the Gaussian probability density function. We also try to achieve a parsimonious network topology by using a systematic procedure. According to experimental results, the proposed method achieved fairly comparable performance with smaller number of hidden layer nodes to the conventional approach in terms of correct classification rates. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Ahn, S. M., & Baik, S. (2005). Minimal RBF networks by Gaussian mixture model. In Lecture Notes in Computer Science (Vol. 3644, pp. 919–927). Springer Verlag. https://doi.org/10.1007/11538059_95

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