Title :
On the state transition graph of Hopfield net model
Author :
Lee, C.Y. ; Wang, J.S. ; Lee, R.C.T.
Abstract :
Relations of stable states between different Hopfield neural nets are shown, and upper bounds to their transient lengths are given. The proofs of the results lie in examining the sinks and the maximum path length of the state transition graph. If W is the weight matrix of a Hopfield associative memory determined from m reference patterns, the experiments showed that Pmax(G(W,Θ)) is of order O( mn) and Tord(GB(W,Θ))=2 when m =1 or 2, for all n⩾3, where n is the size of the net and Θ is zero factor
Keywords :
content-addressable storage; neural nets; Hopfield associative memory; Hopfield neural nets; state transition graph; upper bounds;
Conference_Titel :
Neural Networks, 1990., 1990 IJCNN International Joint Conference on
Conference_Location :
San Diego, CA, USA
DOI :
10.1109/IJCNN.1990.137671
