Algorithm 4.

(Associative) SOINN+ Node linking

1: for i in A do

2:    max(WT) ← Maximum winning time of all nodes

3:    $T(i)\leftarrow \frac{WT(i)-1}{max(WT)-1}$    // Update trustworthiness of each node (Equation 5).

4: end for

5: $\overline{{\tau }_b}$, σb ← mean and standard deviation of the similarity thresholds of all BMUs with an edge to sBMU

6: $\overline{{\tau }_s}$, σs ← mean and standard deviation of the similarity thresholds of all sBMUs with an edge to BMU

7: condition1 $\leftarrow \tau (b)·(1-T(b))<\overline{{\tau }_b}+2·{\sigma }_b$    // (Equation 6)

8: condition2 $\leftarrow \tau (s)·(1-T(s))<\overline{{\tau }_s}+2·{\sigma }_s$    // (Equation 7)

9: if (|E| < 3) or condition1 or condition2 then

10:     if (b, s) ∉ E then

11:       E ← E∪{(b, s)}    // Create an edge between the BMU and the sBMU.

12:       Update $\overline{{\tau }_b}$, $\overline{{\tau }_s}$, σb, σs

13:     end if

14: end if

15: if (b, s) ∈ E then

16:     LT(b, s) ← 0    // Set the lifetime of the BMU, sBMU edge to zero.

17: end if

18: for all i in Nb do

19:     LT(b, i) ← LT(b, i) + 1    // Update the lifetime of all neighbors of the BMU.

20: end for