Study on a Mutation Operator in Evolving Neural Networks
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In order to solve two difficult problems of premature convergence and slow searching speed of genetic algorithms in evolution neural network, a heuristic mutation operator is presented in this paper. Adaptive probability of mutation and heuristic mutation points selected is applied in it. When no evolution appears after many generations, the range of search will be extended by increasing probability of mutation, and a fine search will be started. The experiments of XOR problem demonstrate that the operator has fine adility of speedy convergence and maintains the diversity of the population automatically.

    Reference
    Related
    Cited by
Get Citation

郑志军,郑守淇.进化神经网络中的变异算子研究.软件学报,2002,13(4):726-731

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 07,2000
  • Revised:November 20,2000
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063