Abstract
An autoassociative memory network is constructed by storing character pattern vectors whose components consist of a small positive number ε and 1−ε. Although its connection weights and threshold values can not be determined only by this storing condition, it is proved that the output function of the network is contractive in a region around each stored pattern, if ε is sufficiently small. This implies that the region is a domain of attraction in the network. The shape of the region is clarified in our contraction mapping analysis. In addition to this region, larger domains of attraction are also found. Any noisy pattern vector in such domains, which may have real valued components, can be recognized as one of the stored patterns. Moreover, an autoassociative memory model having large domains of attraction is proposed. This model has symmetric connection weights and is successfully applied to character pattern recognition.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Amari,S., Characteristics of Sparsely Encoded Associative Memory, Neural Net works,Vol.2, 1989, pp.451–457.
Amari,S. and Maginu,K., Statistical Neurodynamics of Associative Memory, Neural Networks, Vol.1, 1988, pp.63–73.
Cottrell,M., Stability and Attractivity in Associative Memory Networks, Biological Cybernetics, Vol.58, 1988, pp.129–139.
McEliece,R.J., Posner,E.C., Rodemich, E.R., and Venkatesh, S.S., The Capacity of the Hopfield Associative Memory, IEEE Transactions on Information Theory,Vol.33, 1987, pp.461–482.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niijima, K. (1993). Domains of attraction in autoassociative memory networks for character pattern recognition. In: Doshita, S., Furukawa, K., Jantke, K.P., Nishida, T. (eds) Algorithmic Learning Theory. ALT 1992. Lecture Notes in Computer Science, vol 743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57369-0_30
Download citation
DOI: https://doi.org/10.1007/3-540-57369-0_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57369-2
Online ISBN: 978-3-540-48093-8
eBook Packages: Springer Book Archive