• DocumentCode
    2705594
  • Title

    A novel pruning algorithm for self-organizing neural network

  • Author

    Honggui, Han ; Junfei, Qiao

  • Author_Institution
    Coll. of Electron. & Control Eng., Beijing Univ. of Technol., Beijing, China
  • fYear
    2009
  • fDate
    14-19 June 2009
  • Firstpage
    1245
  • Lastpage
    1250
  • Abstract
    In this paper, a novel pruning algorithm is proposed for self-organizing the feed-forward neural network based on the sensitivity analysis, named novel pruning feed-forward neural network (NP-FNN). In this study, the number of hidden neurons is determined by the output´s sensitivity to the hidden nodes. This technique determines the relevance of the hidden nodes by analyzing the Fourier decomposition of the variance. Then each hidden node can obtain a contribution ratio. The connected weights of the hidden nodes with small ratio will be set as zeros. Therefore, the computational cost of the training process will be reduced significantly. It is clearly shown that the novel pruning algorithm minimizes the complexity of the final feed-forward neural network. Finally, computer simulation results are carried out to demonstrate the effectiveness of the proposed algorithm.
  • Keywords
    Fourier analysis; feedforward neural nets; self-organising feature maps; sensitivity analysis; Fourier decomposition; feed-forward neural network; hidden neurons; novel pruning algorithm; novel pruning feedforward neural network; self-organizing neural network; sensitivity analysis; Analysis of variance; Biological neural networks; Convergence; Feedforward neural networks; Feedforward systems; Genetic algorithms; Least squares approximation; Neural networks; Neurons; Sensitivity analysis; Feed-forward neural network (FNN); Pruning algorithm; Sensitivity analysis of model output (SAMO);
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 2009. IJCNN 2009. International Joint Conference on
  • Conference_Location
    Atlanta, GA
  • ISSN
    1098-7576
  • Print_ISBN
    978-1-4244-3548-7
  • Electronic_ISBN
    1098-7576
  • Type

    conf

  • DOI
    10.1109/IJCNN.2009.5178581
  • Filename
    5178581