Skip to main content
. 2024 Mar 1;18:1305284. doi: 10.3389/fnins.2024.1305284
Algorithm 1: M-ESN Optimization.
Input: Modules count M ; Intra-community connectivity P1 ; Inter-community connectivity P2 ; DEAP dataset.
Output: Optimal combinations of P1 , P2 , and M .
1: Let data =normalize (data).
2: for P1 = 0.05, 0.1, 0.15, 0.2, 0.25, 0.3 do
3: for M = 1, 2, 3, 4, 5, 6, 8, 10 do
4: for P2=15P1,25P1,P1 do
5: Acc = MESN( M , P1 , P2 )
6: if Acc’ < Accthen
7: Acc’, M , P1 , P2 ’ = Acc, M , P1 , P2.
8: end for
9: end for
10: end for
11: return M , P1 , P2
12: end