• DocumentCode
    2277968
  • Title

    Overlapping swarm intelligence for training artificial neural networks

  • Author

    Pillai, Karthik Ganesan ; Sheppard, John W.

  • Author_Institution
    Dept. of Comput. Sci., Montana State Univ., Bozeman, MT, USA
  • fYear
    2011
  • fDate
    11-15 April 2011
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    A novel overlapping swarm intelligence algorithm is introduced to train the weights of an artificial neural network. Training a neural network is a difficult task that requires an effective search methodology to compute the weights along the edges of a network. The backpropagation algorithm, a gradient based method, is frequently used to train multilayer feed-forward networks. Gradient based methods might not always lead to a globally optimal solution of the network. On the other hand, training algorithms based on evolutionary computation have been used to train multilayer feed-forward networks in an attempt to overcome the limitations of gradient based algorithms with mixed results. This paper introduces an overlapping swarm intelligence technique to train multilayer feedforward networks. The results show that OSI method performs either on par with or better than the other methods tested.
  • Keywords
    backpropagation; evolutionary computation; feedforward neural nets; gradient methods; particle swarm optimisation; search problems; OSI method; backpropagation algorithm; evolutionary computation; gradient based method; multilayer feedforward networks; overlapping swarm intelligence technique; search methodology; training artificial neural networks; Artificial neural networks; Backpropagation algorithms; Feedforward neural networks; Neurons; Open systems; Particle swarm optimization; Training; Backpropagation; machine learning; neural networks; particle swarm optimization; swarm intelligence;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Swarm Intelligence (SIS), 2011 IEEE Symposium on
  • Conference_Location
    Paris
  • Print_ISBN
    978-1-61284-053-6
  • Type

    conf

  • DOI
    10.1109/SIS.2011.5952566
  • Filename
    5952566