DocumentCode :
3565840
Title :
Internal representation in networks of nonmonotonic processing units
Author :
McCaughan, David B. ; Medler, David A. ; Dawson, Michael R W
Author_Institution :
Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada
Volume :
1
fYear :
1999
fDate :
6/21/1905 12:00:00 AM
Firstpage :
599
Abstract :
Connectionist networks that use nonmonotonic transfer functions tend to adopt highly structured internal representations, revealed as vertical banding in density plots of internal unit activities. Recent work has shown this banding to be easily analyzed allowing for the extraction of symbolic descriptions of the solution encoded in the network. While the banding phenomenon is well documented, the properties that give rise to this structure have never been formalized. In this paper we detail the geometry that underlies the internal unit activity clustering that banding represents. These results distinguish the operation of nonmonotonic units from that of traditional sigmoid devices in terms of the mechanism by which they carve up the input space
Keywords :
computational geometry; neural nets; pattern classification; transfer functions; activity clustering; banding; connectionist networks; internal representation; neural networks; nonmonotonic transfer functions; Cognition; Equations; Feedforward systems; Geometry; Intelligent networks; Logistics; Pattern classification; Psychology; Visualization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 1999. IJCNN '99. International Joint Conference on
ISSN :
1098-7576
Print_ISBN :
0-7803-5529-6
Type :
conf
DOI :
10.1109/IJCNN.1999.831566
Filename :
831566
Link To Document :
بازگشت