• DocumentCode
    2786905
  • Title

    A neural network learning algorithm based on hybrid particle swarm optimization

  • Author

    Zaifei, Luo ; Binglei, Guan ; Shiguan, Zhou

  • Author_Institution
    Acad. of Electrics & Inf., Ningbo Univ. of Technol., Ningbo, China
  • fYear
    2009
  • fDate
    17-19 June 2009
  • Firstpage
    3255
  • Lastpage
    3259
  • Abstract
    A hybrid learning algorithm based on simplex method and particle swarm optimization is proposed to train the feedforward neural network in this paper. In the given hybrid algorithm the simplex method which has expansion function and contraction function is embedded in the particle swarm optimization as an operator. Through cross-training mode to train neural network, this hybrid algorithm selects limited elitist particles and executes simplex operator for local searching during each generation of particle swarm optimization, which can make the neural network learning approximate to the global optimum region rapidly and find more excellent solution. The simulation experiments show that comparing with some traditional learning methods this hybrid algorithm enhances the convergence speed and training precision, and improves network performance. It is an effective neural network learning method.
  • Keywords
    feedforward neural nets; learning (artificial intelligence); particle swarm optimisation; contraction function; cross-training mode; expansion function; feedforward neural network training; hybrid particle swarm optimization; local searching; neural network learning algorithm; Electronic mail; Error correction; Feedforward neural networks; Genetic algorithms; Hybrid power systems; Learning systems; Neural networks; Particle swarm optimization; Size control; feedforward neural network; hybrid algorithm; particle swarm optimization; simplex method;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Decision Conference, 2009. CCDC '09. Chinese
  • Conference_Location
    Guilin
  • Print_ISBN
    978-1-4244-2722-2
  • Electronic_ISBN
    978-1-4244-2723-9
  • Type

    conf

  • DOI
    10.1109/CCDC.2009.5192123
  • Filename
    5192123