Analysis of Hidden Representations by Greedy Clustering
作者:
RUDY SETIONO HUAN LIU,
期刊:
Connection Science
(Taylor Available online 1998)
卷期:
Volume 10,
issue 1
页码: 21-42
ISSN:0954-0091
年代: 1998
DOI:10.1080/095400998116567
出版商: Taylor & Francis Group
关键词: Backpropagation Neural Network;Hidden Representation;Pruning;Rule Extraction
数据来源: Taylor
摘要:
The hidden layer of backpropagation neural networks (NNs) holds the key to the networks' success in solving pattern classification problems. The units in the hidden layer encapsulate the network's internal representations of the outside world described by the input data. this paper, the hidden representations of trained networks are investigated by means simple greedy clustering algorithm. This clustering algorithm is applied to networks have been trained to solve well-known problems: the monks problems, the 5-bit problem and the contiguity problem. The results from applying the algorithm to problems with known concepts provide us with a better understanding of NN learning. These also explain why NNs achieve higher predictive accuracy than that of decision-tree methods. The results of this study can be readily applied to rule extraction from Production rules are extracted for the parity and the monks problems, as well as benchmark data set: Pima Indian diabetes diagnosis. The extracted rules from the Indian diabetes data set compare favorably with rules extracted from ARTMAP NNs terms of predictive accuracy and simplicity.
点击下载:
PDF (315KB)
返 回