Abstract
A simple generalization of the Hopfield memory is presented. The model proposed updates simultaneously groups of a fixed number of neurons that are disjoint in the sense that each neuron belongs to one and only one group. An analysis is presented of the case in which one of the groups is chosen at random with equal probability and then is updated according to a rule equivalent to the one given by J.J. Hopfield (1982). It is shown that the rule minimizes an energy function in the same way as the original Hopfield model. Sufficient conditions on the corresponding connection matrix as to ensure stability are given.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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 callMore From: IEEE Transactions on Systems, Man, and Cybernetics
Disclaimer: 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.
