Skip to main content
. 2022 Sep 3;12(9):1191. doi: 10.3390/brainsci12091191
Algorithm 2 Recognition Algorithm.
  1: INPUT   
  2: Test={zl+1,zl+2⋯,zm}, xi,j, i=1,2,⋯,l and j=1,2⋯,mc;
  3:
  4: OUTPUT   
  5: Ztest^;
  6:
  7: Let fi(t=0)=−0.2, gj=−0.2, where i=1,2,⋯,l and j=1,2⋯,mc;
  8: for each zk∈Test do
  9:     Let ef,k(t)=1;
10:     Compute the stationary solution fi∗, i=1,2,⋯,l of the Equation (1);
11:     Compute the stationary solution gj,j=1,2⋯,mc of the Equation (10);
12:     while Aesn≠1 do
13:         Adjust the scale σ1 by Algorithm 1;
14:         Compute the stationary solution gj,j=1,2⋯,mc of the Equation (10);
15:     end while
16:     Let zk^=z(r), where r is the category pattern that stored by the senior neuron with the highest activation;
17: end for
18: Ztest^={zk^}, k=l+1,l+2,⋯,m.