GMBH-type neural network modeling in evolutionary optimization

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

Abstract

We discuss a new design of group method of data handling (GMDH)-type neural network using evolutionary algorithm. The performances of the GMDH-type network depend strongly on the number of input variables and order of the polynomials to each node. They must be fixed by designer in advance before the architecture is constructed. So the trial and error method must go with heavy computation burden and low efficiency. To alleviate these problems we employed evolutionary algorithms. The order of the polynomial, the number of input variables, and the optimum input variables are encoded as a chromosome and fitness of each chromosome is computed. The appropriate information of each node are evolved accordingly and tuned gradually throughout the GA iterations. By the simulation results, we can show that the proposed networks have good performance. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Kim, D., & Park, G. T. (2005). GMBH-type neural network modeling in evolutionary optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3533 LNAI, pp. 563–570). Springer Verlag. https://doi.org/10.1007/11504894_79

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