|
|
|
| SPARSED CONNECTION WEIGHTS OF HIGHER-ORDER NEURAL NETWORK AND ITS PRUNING ALGORITHM |
| Li Shouli①; Li Jinyan②; Li Wangchao① |
| ①Hebei University of Technology Tianjin 300130;②The University of Melbourne Australia |
|
|
|
|
Abstract In this paper, the fully-connected higher-order neuron and sparsed higher-order neuron are introduced, the mapping capabilities of the fully-connected higher-order neural networks are investigated, and that arbitrary Boolean function defined from {0,1}N can be realized by fully-connected higher-order neural networks is proved. Based on this, in order to simplify the networks architecture, a pruning algorithm for eliminating the redundant connection weights is also proposed, which can be applied to the implementation of sparsed higher-order neural
classifier. The simulated results show the effectiveness of the algorithm.
|
|
Received: 25 August 1997
|
|
|
|
|
|
|
|
|
1999, Vol. 21 
