Table - PMC

Skip to main content

View full-text article in PMC

. 2020 Oct 12;20(20):5766. doi: 10.3390/s20205766

Subroutine 2Pattern Learning Subroutine (C)

Input: Ordered candidate pattern set C

Output: Loop pattern set $L P$

1:
$L P \leftarrow \emptyset$
2:
for candidate $c_{i}$ !=-1 in C do
3:
for $c_{j}$ in $C [i + 1 : l e n (C)]$ do
4:
$c_{j} \leftarrow$ -1 if $c_{i} \subseteq c_{j}$
5:
end for
6:
$L P$ .append( $c_{i}$ ) if $c_{i}$ !=-1
7:
end for
8:
for $d_{i}$ in D do
9:
$S L \leftarrow$ Sequence Processing Subroutine( $d_{i}, L P, E$ )
10:
for $l p_{i}$ in $L P$ do
11:
if no sequential $l p_{i}, l p_{i}$ in $S L$ then
12:
$L P$ .remove( $l p_{i}$ )
13:
end if
14:
end for
15:
end for
16:
return $L P$