Associative memory by Hopfield NN with chaos injection

Several people point out that the Hopfield neural network (abbr.NN ) with chaos injection gains the good performance for solving traveling salesman problems, which is one of combinatorial optimization problems. In this study, we investigate the performance of the intermittency chaos injected to the Hopfield NN working as an associative memory. The rate and the speed of the convergence to an embedded pattern are evaluated by computer simulations.. Furthermore, in order to confirm the reason of the good ability of intermittency chaos, we carry out the same simulation using the time series produced by the Markov chain model. Simulated results show that the Markov chain model is good enough to gain similar performance of the intermittency chaos.