Loading...

A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks

Beigy, H ; Sharif University of Technology

1323 Viewed
  1. Type of Document: Article
  2. DOI: 10.1080/00207720802145924
  3. Abstract:
  4. There is no method to determine the optimal topology for multi-layer neural networks for a given problem. Usually the designer selects a topology for the network and then trains it. Since determination of the optimal topology of neural networks belongs to class of NP-hard problems, most of the existing algorithms for determination of the topology are approximate. These algorithms could be classified into four main groups: pruning algorithms, constructive algorithms, hybrid algorithms and evolutionary algorithms. These algorithms can produce near optimal solutions. Most of these algorithms use hill-climbing method and may be stuck at local minima. In this article, we first introduce a learning automaton and study its behaviour and then present an algorithm based on the proposed learning automaton, called survival algorithm, for determination of the number of hidden units of three layers neural networks. The survival algorithm uses learning automata as a global search method to increase the probability of obtaining the optimal topology. The algorithm considers the problem of optimization of the topology of neural networks as object partitioning rather than searching or parameter optimization as in existing algorithms. In survival algorithm, the training begins with a large network, and then by adding and deleting hidden units, a near optimal topology will be obtained. The algorithm has been tested on a number of problems and shown through simulations that networks generated are near optimal
  5. Keywords:
  6. Neural networks engineering ; Neural networks topology ; Automata theory ; Backpropagation ; Education ; Evolutionary algorithms ; Learning algorithms ; Robots ; Structural optimization ; Topology ; Translation (languages) ; Constructive algorithms ; Global searches ; Hidden units ; Hill-climbing methods ; Hybrid algorithms ; Large networks ; Learning automata ; Local minimums ; Main groups ; Multi-layer neural networks ; Near-optimal solutions ; NP-hard problems ; Optimal topologies ; Parameter optimizations ; Pruning algorithms ; Three layers ; Three-layer neural networks ; Neural networks
  7. Source: International Journal of Systems Science ; Volume 40, Issue 1 , 2009 , Pages 101-118 ; 00207721 (ISSN)
  8. URL: http://www.tandfonline.com/doi/abs/10.1080/00207720802145924