DocumentCode
2959491
Title
A modified version of a formal pruning algorithm based on local relative variance analysis
Author
Fnaiech, Nader ; Abid, Sabeur ; Fnaiech, Farhat ; Cheriet, Mohamed
Author_Institution
Centre de Recherche en Productique, ESSTT, Tunis, Tunisia
fYear
2004
fDate
21-24 March 2004
Firstpage
849
Lastpage
852
Abstract
A modified version of a formal pruning algorithm initially proposed by Englebercht [November, 2001] using variance analysis of sensitivity is presented. We propose a new modification of the algorithm by applying the pruning procedure on each layer starting from the output layer to the input layer. Contrarily, to the work of Englebercht where the pruning is performed on the entire net that we denote in this paper global pruning, we shall prune layer by layer with the use of a pruning decision based on a local parameter variance ity coefficient (LPVN). These coefficients are then classified in an ordered list which allows the decision making examples showing that in some cases we can reach about 30% improvement in terms of coefficients and neurons removal in order to get the best neural network pruned. A comparison study is given on some real world learning and generalization.
Keywords
decision making; feedforward neural nets; sensitivity analysis; formal pruning algorithm; local parameter variance nullity coefficient; local relative variance analysis; neural network; Algorithm design and analysis; Analysis of variance; Artificial neural networks; Biological neural networks; Decision making; Iterative algorithms; Multi-layer neural network; Neural networks; Neurons; Surges;
fLanguage
English
Publisher
ieee
Conference_Titel
Control, Communications and Signal Processing, 2004. First International Symposium on
Print_ISBN
0-7803-8379-6
Type
conf
DOI
10.1109/ISCCSP.2004.1296579
Filename
1296579
Link To Document