Exact Learning Augmented Naive Bayes Classifier

. 2021 Dec 20;23(12):1703. doi: 10.3390/e23121703

Algorithm A3

G e t B e s t S i n k s (V, b p s, L S)

for all $Z \subseteq V$ such that $X_{0} \in Z$ in lexicographic order do
$s c o r e s [Z] \leftarrow 0.0$
$s i n k s [Z] \leftarrow - 1$
for all $s i n k \in Z ∖ {X_{0}}$ do
$u p v a r s \leftarrow Z ∖ {s i n k}$
$s k o r e \leftarrow s c o r e s [u p v a r s]$
$s k o r e \leftarrow s k o r e + L S [s i n k] [b p s [s i n k] [u p v a r s]]$
if $s i n k s [Z] = - 1$ or $s k o r e > s c o r e s [Z]$ then
$s c o r e s [Z] \leftarrow s k o r e$
$s i n k s [Z] \leftarrow s i n k$
end if
end for
end for