• DocumentCode
    1328344
  • Title

    Feedforward neural network design with tridiagonal symmetry constraints

  • Author

    Dumitras, Adriana ; Kossentini, Faouzi

  • Author_Institution
    Dept. of Electr. & Comput. Eng., British Columbia Univ., Vancouver, BC, Canada
  • Volume
    48
  • Issue
    5
  • fYear
    2000
  • fDate
    5/1/2000 12:00:00 AM
  • Firstpage
    1446
  • Lastpage
    1454
  • Abstract
    This paper introduces a pruning algorithm with tridiagonal symmetry constraints for feedforward neural network (FANN) design. The algorithm uses a reflection transform applied to the input-hidden weight matrix in order to reduce it to its tridiagonal form. The designed FANN structures obtained by applying the proposed algorithm are compact and symmetrical. Therefore, they are well suited for efficient hardware and software implementations. Moreover, the number of the FANN parameters is reduced without a significant loss in performance. We illustrate the complexity and performance of the proposed algorithm by applying it as a solution to a nonlinear regression problem. We also compare the results of our proposed algorithm with those of the optimal brain damage algorithm
  • Keywords
    computational complexity; feedforward neural nets; matrix algebra; statistical analysis; transforms; FANN design; complexity; feedforward neural network design; input-hidden weight matrix; nonlinear regression problem; performance; pruning algorithm; reflection transform; tridiagonal symmetry constraints; Algorithm design and analysis; Biological neural networks; Costs; Design methodology; Feedforward neural networks; Hardware; Neural networks; Performance loss; Reflection; Symmetric matrices;
  • fLanguage
    English
  • Journal_Title
    Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1053-587X
  • Type

    jour

  • DOI
    10.1109/78.839989
  • Filename
    839989