Anomalies Detection and Proactive Defence of Routers Based on Multiple Information Learning

. 2019 Jul 26;21(8):734. doi: 10.3390/e21080734

Algorithm 1 LCS cluster tree building algorithm.

Require :
Sampling cluster A, $C_{i j}$ $ϵ$ A ( $i = 1$ to p and $j = 1$ to x)
Ensure :
The pre-attack steps array $L S [] []$ of each attack $a_{i}$
1:
for ( $i = 1$ ; $i < p$ ; i++) do
2:
$k = 0$ ;
3:
for ( $m = 2$ ; $m < = x$ ; m++) do
4:
for ( $n = 1$ ; $n < = m$ ; n++) do
5:
s = $L C S (C_{i m}, C_{i n})$ ;
6:
if (s!= $n u l l$ ) then
7:
$L S$ [i][k++]=s;
8:
$B u i l d_T r e e (s)$ ;
9:
end if
10:
end for
11:
end for
12:
end for