DocumentCode
691858
Title
Twice-Pruning Aided WASD Neuronet of Bernoulli-Polynomial Type with Extension to Robust Classification
Author
Yunong Zhang ; Dechao Chen ; Long Jin ; Ying Wang ; Feiheng Luo
Author_Institution
Sch. of Inf. Sci. & Technol., Sun Yat-sen Univ., Guangzhou, China
fYear
2013
fDate
21-22 Dec. 2013
Firstpage
334
Lastpage
339
Abstract
This paper proposes a novel multi-input Bernoulli-polynomial neuronet (MIBPN) on the basis of function approximation theory. The MIBPN is trained by a weights-and-structure-determination (WASD) algorithm with twice pruning (TP). The WASD algorithm can obtain the optimal weights and structure for the MIBPN, and overcome the weaknesses of conventional BP (back-propagation) neuronets such as slow training speed and local minima. With the TP technique, the neurons of less importance in the MIBPN are pruned for less computational complexity. Furthermore, this MIBPN can be extended to a multiple input multiple output Bernoulli-polynomial neuronet (MIMOBPN), which can be applied as an important tool for classification. Numerical experiment results show that the MIBPN has outstanding performance in data approximation and generalization. Besides, experiment results based on the real-world classification data-sets substantiate the high accuracy and strong robustness of the MIMOBPN equipped with the proposed WASD algorithm for classification. Finally, the twice-pruning aided WASD neuronet of Bernoulli-polynomial type in the forms of MIBPN and MIMOBPN is established, together with the effective extension to robust classification.
Keywords
backpropagation; feedforward neural nets; function approximation; pattern classification; BP; MIBPN; MIMOBPN; TP technique; WASD algorithm; backpropagation neuronets; computational complexity; data approximation; function approximation theory; generalization; multiinput Bernoulli-polynomial neuronet; multiple input multiple output Bernoulli-polynomial neuronet; robust classification; twice pruning technique; twice-pruning aided WASD neuronet; weights-and-structure-determination algorithm; Approximation algorithms; Approximation error; Neurons; Polynomials; Robustness; Training; Bernoulli-polynomial neuronet; function approximation; robust classification; twice pruning; weights-and-structure-determination (WASD) algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Dependable, Autonomic and Secure Computing (DASC), 2013 IEEE 11th International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4799-3380-8
Type
conf
DOI
10.1109/DASC.2013.85
Filename
6844385
Link To Document