Abstract
Genetic algorithms (GA) have been used for training of fixed structure neural networks and for optimisation of network structure. The crucial issue of algorithms is their premature convergence that deteriorates the diversity of individual search points. Several techniques have being applied to retain the diversity of the search point distribution. In this paper the application of a breeder genetic algorithm (BGA) for neural network learning is considered as well as the problem of retaining diversity. Truncation selection, extended intermediate recombination, and variable mutation range are proposed. It is shown that the performance of BGA is superior to GA in retaining diversity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
