• DocumentCode
    2932549
  • Title

    A comparison of matrix rewriting versus direct encoding for evolving neural networks

  • Author

    Siddiqi, A.A. ; Lucas, S.M.

  • Author_Institution
    Dept. of Electron. Syst. Eng., Essex Univ., Colchester, UK
  • fYear
    1998
  • fDate
    4-9 May 1998
  • Firstpage
    392
  • Lastpage
    397
  • Abstract
    The intuitive expectation is that the scheme used to encode the neural network in the chromosome should be critical to the success of evolving neural networks to solve difficult problems. In 1990 Kitano published an encoding scheme based on context-free parallel matrix rewriting. The method allowed compact, finite, chromosomes to grow neural networks of potentially infinite size. Results were presented that demonstrated superior evolutionary properties of the matrix rewriting method compared to a simple direct encoding. The authors present results that contradict those findings, and demonstrate that a genetic algorithm (GA) using a direct encoding can find good individuals just as efficiently as a GA using matrix rewriting
  • Keywords
    encoding; genetic algorithms; matrix algebra; neural nets; chromosome; compact finite chromosomes; context-free parallel matrix rewriting; direct encoding; evolutionary properties; genetic algorithm; neural network evolution; Biological cells; Biological information theory; Convergence; Encoding; Genetic algorithms; Guidelines; Inspection; Neural networks; Organisms; Systems engineering and theory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on
  • Conference_Location
    Anchorage, AK
  • Print_ISBN
    0-7803-4869-9
  • Type

    conf

  • DOI
    10.1109/ICEC.1998.699787
  • Filename
    699787