| (1) | Input vector = (1, 2, ..., n), i.e., QuSOMs learn all of information simultaneously. | | (2) | One operation of competitive and updating, for s iterations | | (3) | = U (in first operation, = ); | | (4) | Ds = |||| | | (5) | ds(i, jmin) = min(ds(i, 1), ds(i, 2), ..., ds(i, P)); i = 1, 2, ..., Z; | | (6) | (i, jmin) = (i, jmin) + η(s)[x(i, jmin)−(i, jmin)], if j = jmin, | | (7) | (i, j) = (i, j) | | (8) | If – > ε go to 9, otherwise go to step 10 | | (9) | = Q go to 3 | | (10) | Store and stop |
|