Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/99189
Title: Analysis of Hidden Representations by Greedy Clustering
Authors: Setiono, R. 
Liu, H. 
Keywords: Backpropagation neural network
Clustering
Hidden representation
Pruning
Rule extraction
Issue Date: Mar-1998
Citation: Setiono, R.,Liu, H. (1998-03). Analysis of Hidden Representations by Greedy Clustering. Connection Science 10 (1) : 21-42. ScholarBank@NUS Repository.
Abstract: 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. In this paper, the hidden representations of trained networks are investigated by means of a simple greedy clustering algorithm. This clustering algorithm is applied to networks that have been trained to solve well-known problems: the monks problems, the 5-bit parity 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 results 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 NNs. Production rules are extracted for the parity and the monks problems, as well as for a benchmark data set: Pima Indian diabetes diagnosis. The extracted rules from the Pima Indian diabetes data set compare favorably with rules extracted from ARTMAP NNs in terms of predictive accuracy and simplicity.
Source Title: Connection Science
URI: http://scholarbank.nus.edu.sg/handle/10635/99189
ISSN: 09540091
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

66
checked on Jan 26, 2020

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.