• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

Honggui, Han (Honggui, Han.) (Scholars:韩红桂) | Junfei, Qiao (Junfei, Qiao.) (Scholars:乔俊飞)

Indexed by:

EI Scopus

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. ©2009 IEEE.

Keyword:

Computational complexity Sensitivity analysis Feedforward neural networks

Author Community:

  • [ 1 ] [Honggui, Han]College of Electronic and Control Engineering, Beijing University of Technology, Beijing, China
  • [ 2 ] [Junfei, Qiao]College of Electronic and Control Engineering, Beijing University of Technology, Beijing, China

Reprint Author's Address:

Show more details

Related Keywords:

Related Article:

Source :

Year: 2009

Page: 1245-1250

Language: English

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count: 3

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 0

Online/Total:1095/5329576
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.