Title of article :
A genetic algorithm to obtain the optimal recurrent neural network Original Research Article
Author/Authors :
A. Blanco، نويسنده , , M. Delgado، نويسنده , , M.C. Pegalajar، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2000
Pages :
17
From page :
67
To page :
83
Abstract :
Selecting the optimal topology of a neural network for a particular application is a difficult task. In the case of recurrent neural networks, most methods only induce topologies in which their neurons are fully connected. In this paper, we present a genetic algorithm capable of obtaining not only the optimal topology of a recurrent neural network but also the least number of connections necessary. Finally, this genetic algorithm is applied to a problem of grammatical inference using neural networks, with very good results.
Keywords :
Recurrent neural network , Grammatical inference , Deterministic finite automata , Regular grammars , Optimal recurrent neural network , Genetic Algorithm
Journal title :
International Journal of Approximate Reasoning
Serial Year :
2000
Journal title :
International Journal of Approximate Reasoning
Record number :
1181550
Link To Document :
بازگشت