A Competitive Associative Memory Model and Its Dynamics

Unlike most of the conventional networks, the proposed model takes only the prototype patterns as its equilibrium points, so that the spurious points are effectively excluded. Furthermore, it is shown that, as the competitive parameters vary, the network has a unique stable equilibrium point corresponding to the winner competitive parameter and, in this case, the unique stable equilibrium state can be recalled from any initial key. Conventional associative memory networks perform noncompetitive recognition or “competitive recognition in distance.” In this paper a “competitive recognition” associative memory model is introduced which simulates the competitive persistence of biological species.