A genetic algorithm with adaptive mutations and family competition for training neural networks.
In this paper, we present a new evolutionary technique to train three general neural networks. Based on family competition principles and adaptive rules, the proposed approach integrates decreasing-based mutations and self-adaptive mutations to collaborate with each other. Different mutations act as global and local strategies respectively to balance the trade-off between solution quality and convergence speed. Our algorithm is then applied to three different task domains: Boolean functions, regular language recognition, and artificial ant problems. Experimental results indicate that the proposed algorithm is very competitive with comparable evolutionary algorithms. We also discuss the search power of our proposed approach.
Yang
J M
JM
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, ROC. moon@csie.ntu.edu.tw
Horng
J T
JT
Kao
C Y
CY
D000465:Algorithms; D000818:Animals; D001185:Artificial Intelligence; D002875:Chromosomes / Q000235:genetics; D005823:Genetics / Q000193:education*; D006801:Humans; D007802:Language; D008954:Models, Biological; D009154:Mutation / Q000502:physiology; D016571:Neural Networks, Computer; D016011:Normal Distribution