Abstract
An autoassociative memory network is constructed by storing reference pattern vectors whose components consist of a small positive number ∈ and 1-∈. Although its connection weights can not be determined only by this storing condition, it is proved that the output function of the network becomes a contraction mapping 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 analysis. Domains of attraction larger than this region 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. We propose a method for determining connection weights of the network, which uses the shape of the domains of attraction. The model obtained by this method has symmetric connection weights and is successfully applied to character pattern recognition.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
