๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A model of orthogonal auto-associative networks

โœ Scribed by K. Matsuoka


Book ID
104659985
Publisher
Springer-Verlag
Year
1990
Tongue
English
Weight
477 KB
Volume
62
Category
Article
ISSN
0340-1200

No coin nor oath required. For personal study only.

โœฆ Synopsis


Two types of auto-associative networks are well known, one based upon the correlation matrix and the other based upon the orthogonal projection matrix, both of which are calculated from the pattern vectors to be memorized. Although the latter type of networks have a desirable associative property compared to the former ones, they require, in conventional models, nonlocal calculation of the pattern vectors (i.e., pseudoinverse of a matrix) or some learning procedure based on the error correction paradigm. This paper proposes a new model of auto-associative networks in which the orthogonal projection is implemented in a special relation between the connections linking neuron-like elements. The connection weights can be determined by a Hebbian local learning, requiring no pseudoinverse calculation nor the error correction learning.


๐Ÿ“œ SIMILAR VOLUMES


On the design of artificial auto-associa
โœ Stefan Reimann ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 502 KB

In this paper, we consider the problem of how to construct an artificial neuronal network such that it reproduces a given set of patterns in an exact manner. It turns out that the structure of the weight matrix of the network represents the structure of the set of patterns it is acting on, not the p