Evolutionary algorithm of radial basis function neural networks and its application in face recognition

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

Abstract

This paper proposes a new evolutionary algorithm (EA) which includes five different mutation operators: nodes merging, nodes deletion, penalizing, nodes inserting and hybrid training. The algorithm adaptively determines the structure and parameters of the radial basis function neural networks (RBFN). Many different radial basis functions with different sizes (covering area, locations and orientations) were used to construct the near-optimal RBFN during training. The resulting RBFN behaves even more powerful and requires fewer nodes than other algorithms. Simulation results in face recognition show that the system achieves excellent performance both in terms of error rates of classification and learning efficiency. © 2006 Springer.

Cite

CITATION STYLE

APA

Li, J., Huang, X., Li, R., Yang, S., & Qi, Y. (2006). Evolutionary algorithm of radial basis function neural networks and its application in face recognition. In Advances in Soft Computing (Vol. 35, pp. 65–74). https://doi.org/10.1007/3-540-33521-8_7

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