Graph Matching Recombination for Evolving Neural Networks

  • Authors:
  • Ashique Mahmood;Sadia Sharmin;Debjanee Barua;Md. Monirul Islam

  • Affiliations:
  • Bangladesh University of Engineering and Technology, Department of Computer Science and Engineering, Dhaka, Bangladesh;Bangladesh University of Engineering and Technology, Department of Computer Science and Engineering, Dhaka, Bangladesh;Bangladesh University of Engineering and Technology, Department of Computer Science and Engineering, Dhaka, Bangladesh;Bangladesh University of Engineering and Technology, Department of Computer Science and Engineering, Dhaka, Bangladesh

  • Venue:
  • ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new evolutionary system using genetic algorithm for evolving artificial neural networks (ANNs). Existing genetic algorithms (GAs) for evolving ANNs suffer from the permutation problem. Frequent and abrupt recombination in GAs also have very detrimental effect on the quality of offspring. On the other hand, Evolutionary Programming (EP) does not use recombination operator entirely. Proposed algorithm introduces a recombination operator using graph matching technique to adapt structure of ANNs dynamically and to avoid permutation problem. The complete algorithm is designed to avoid frequent recombination and reduce behavioral disruption between parents and offspring. The evolutionary system is implemented and applied to three medical diagnosis problems - breast cancer, diabetes and thyroid. The experimental results show that the system can dynamically evolve compact structures of ANNs, showing competitiveness in performance.