• DocumentCode
    1135855
  • Title

    Algorithm for building a neural network for function approximation

  • Author

    Jayadeva ; Deb, A.K. ; Chandra, S.

  • Author_Institution
    Dept. of Electr. Eng., Indian Inst. of Technol., New Delhi, India
  • Volume
    149
  • Issue
    56
  • fYear
    2002
  • Firstpage
    301
  • Lastpage
    307
  • Abstract
    A technique for constructing a multilayer tree-structured neural network, which provides a continuous, piece-wise linear function approximation, is presented. The method uses a growth network with linear threshold neurons. Neurons are added to a binary tree until the approximation error at all sampling points is brought down to within a specified ±Δ. The number of neurons in the constructed network depends on the samples provided as well as the specified tolerance Δ, thus enabling a trade-off between accuracy and network size. In comparison to approaches such as back propagation, the proposed technique requires no assumptions regarding the number of neurons, learning rate, momentum term, or initial weight values. It also does not suffer from problems of local minima. Examples are presented to illustrate the effectiveness of the technique.
  • Keywords
    function approximation; linear programming; multilayer perceptrons; piecewise linear techniques; trees (mathematics); accuracy; approximation error; binary tree; growth network; initial weight values; linear programming; linear threshold neurons; multilayer tree-structured neural network; network size; piece-wise linear function approximation; tolerance;
  • fLanguage
    English
  • Journal_Title
    Circuits, Devices and Systems, IEE Proceedings -
  • Publisher
    iet
  • ISSN
    1350-2409
  • Type

    jour

  • DOI
    10.1049/ip-cds:20020514
  • Filename
    1176572