The complexity of recognition in the single-layered PLN network with feedback connections
- 15 Downloads
Regarding a single-layered PLN network with feedback connections as an associative memory network, the complexity of recognition is discussed. We have the main result: if the size of the networkN ism, then the complexity of recognition is an exponential function ofm. The necessary condition under which the complexity of recognition is polynomial is given.
KeywordsPLN network stable state associative memory network Markov chain transition matrix complexity of recognition
Unable to display preview. Download preview PDF.
- Zhang Bo, Zhang Linget al., The Complexity of Learning Algorithm in PLN Network. International Joint Conference on Neural Network (IJCNN'91), Singapore, Nov. 1991.Google Scholar
- I. Aleksander (eds.), Neural Computing Architectures. MIT Press, 1989.Google Scholar
- J. Stephen Judd, Neural Network Design and the Complexity of Learning. MIT Press, 1990.Google Scholar
- J. G. Kemey and J. L. Snell. Finite Markov Chains. Springer-Verlag, 1976.Google Scholar