
330 Introduction to Soft Computing
If y
j
≠ −1 Then
Y = [y
1
, y
2
, y
3
] = x × B = [0, 1, 1, 0] ×
.
.
= [0, .67, 0]
Step 8. While reset is True Do Steps 9 To 12.
Step 9. If y
j
= −1 for all cluster units, then all of them are
inhibited and the pattern cannot be learnt by the net.
Otherwise, find the J such that y
J
≥ y
j
for all j = 1 to
n. Then the Jth cluster unit is the winner. In case of
a tie, take the smallest J.
None of the cluster units is inhibited and the cluster unit Y
2
has the largest activation
0.67. So winner is Y
2
, and J = 2.
Step 10. Update x : x
i
= s
i
×t
Ji
for all ...