Table - PMC

Skip to main content

View full-text article in PMC

. 2023 Nov 16;23(22):9217. doi: 10.3390/s23229217

Algorithm 2 Pseudocode of ReliefF-BSTA with feature decomposition.

1:
Input: Dataset D
2:
$\{D_{1}, D_{2}, \dots, D_{n}\} \leftarrow D e c o m p o s e (D)$
3:
for each $i \in [1, n]$ do
4:
Calculate features ranking and feature weights using ReliefF
5:
Get the initial $s_{i}$ solution for $D_{i}$
6:
$B e s t_{i} \leftarrow B S T A (s_{i})$
7:
end for
8:
$s \leftarrow C o n c a t (B e s t_{1}, \dots, B e s t_{n})$
9:
$B e s t^{*} \leftarrow B S T A (s)$
10:
Return $B e s t^{*}$