Abstract
A stochastic search technique based on genetic algorithms for design of task-oriented neural networks is described in the paper. Although the theory of the algorithms is clear, its implementation in the design of neural structures is not yet well investigated. With the help of two case studies, we want to outline the new design approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Montana, D.J., Davis, L.: Training feedforward neural networks using genetic algorithms. Proc. of the 11-th Int. Joint Conf. on AI, pp 762–766, 1989
Whitley, D., Hanson, T.: Optimising neural networks using faster more accurate genetic search. In J.D. Schaffer (ed.), Proceedings of the Third Int. Conf. on Genetic Algorithms, 1989
Harp, S.A., Samad, T.: Genetic Synthesis of Neural Network Architecture. In L. Davis (ed.), Handbook of genetic algorithms, 1991
Cliff, D., Harvey, I., Husbands, P.: Visual Sensory-Motor Networks Without Design: Evolving Visually Guided Robots. Int workshop on Mechatronic Computer Systems for Perception and Action, Halmstad, Sweden, 1992
Dobnikar, A, Likar, A., Trebar, M.: Real time tracking with Stochastic Reinforcement Learning Algorithm, Int. workshop on Mechatronic Computer Systems for Perception and Action, Halmstad, Sweden, 1992
Tadel, M., Grabensek L., Dobnikar A.: Neural Networks without design — evolution with genetic algorithms and genotypes of variable length, int. report (in Slovenian language), LASPP-FER, Ljubljana, 1993.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag/Wien
About this paper
Cite this paper
Dobnikar, A. (1995). Genetic Synthesis of Task-Oriented Neural Networks. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7535-4_86
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7535-4_86
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82692-8
Online ISBN: 978-3-7091-7535-4
eBook Packages: Springer Book Archive