DocumentCode :
328239
Title :
Principal hidden unit analysis: generation of simple networks by minimum entropy method
Author :
Kamimura, Ryotaro
Author_Institution :
Inf. Sci. Lab, Tokai Univ., Kanagawa, Japan
Volume :
1
fYear :
1993
fDate :
25-29 Oct. 1993
Firstpage :
317
Abstract :
In this paper, a principal hidden unit analysis with entropy minimization is proposed to obtain a simple or fundamental structure from original complex structures. The principal hidden unit analysis is composed of four steps: 1) the entropy, defined with respect to the hidden unit activity, is minimized; 2) several principal hidden units are selected, according to R-index, representing the strength of the response of hidden units to input patterns; 3) the performance of the obtained principal network is examined with respect to the error or generalization; and 4) the internal representation of the obtained principal network must appropriately be interpreted. Applied to a symmetry problem, it was confirmed that by using entropy method, a small number of principal hidden units were selected. With these principal hidden units, principal networks were constructed. The internal representation can be interpreted especially for simple problems.
Keywords :
feedforward neural nets; generalisation (artificial intelligence); learning (artificial intelligence); minimisation; minimum entropy methods; entropy minimization; generalization; input patterns; internal representation; neural networks; principal hidden unit analysis; symmetry problem; Entropy; Error correction; Information analysis; Information science; Jacobian matrices; Laboratories; Minimization methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1993. IJCNN '93-Nagoya. Proceedings of 1993 International Joint Conference on
Print_ISBN :
0-7803-1421-2
Type :
conf
DOI :
10.1109/IJCNN.1993.713921
Filename :
713921
Link To Document :
بازگشت