Please use this identifier to cite or link to this item:
Title: Training free counterpropagation networks as static hetero-associative memories
Authors: Rajasekaran, S
Pai, G A Vijayalakshmi
Issue Date: Dec-1997
Publisher: NISCAIR-CSIR, India
Abstract: Counter propagation networks (CPN) that belong to the category of self organization networks, function as statistically optimal self programming look up table. However, the weight adjustment criterion between the input and the competitive layer that follows Kohonen’s unsupervised learning rule, and the same between the competition and the interpolation layer which follows Grossberg's supervised learning rule, can be dispensed with, without affecting the learning ability of the network. Such a network, termed as Training free counter propagation network (TFCPN) is computationally efficient. Also, associative memories which are a class of neural networks are content addressable and possess the capability to store a large set of patterns as memories. In this paper, the TFCPN scheme and its behaviour as a static hetero-associative memory model is discussed. The TFCPN model has been successfully applied to an example in pattern classification and in the design of fink truss in the field of structural engineering.
Page(s): 245-253
ISSN: 0975-1017 (Online); 0971-4588 (Print)
Appears in Collections:IJEMS Vol.04(6) [December 1997]

Files in This Item:
File Description SizeFormat 
IJEMS 4(6) 245-253.pdf1.73 MBAdobe PDFView/Open

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