In this paper, we present a genetic algorithm (GA) based on tournament selection (TS) and deterministic mutation (DM) to evolve neural network systems. We use population diversity to determine the mutation probability for sustaining the convergence capacity and preventing local optimum problem of GA. In addition, we consider population that have a worst fitness and best fitness value for tournament selection to fast convergence. Experimental results with mathematical problems and pattern recognition problem show that the proposed method enhance the convergence capacity about 34.5% and reduce computation power about 40% compared with the conventional method. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Kim, D. S., Kim, H. S., & Chung, D. J. (2006). A genetic algorithm with modified tournament selection and efficient deterministic mutation for evolving neural network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 723–731). Springer Verlag. https://doi.org/10.1007/11759966_106
Mendeley helps you to discover research relevant for your work.