Table - PMC

Skip to main content

View full-text article in PMC

. 2025 Apr 29;25(9):2793. doi: 10.3390/s25092793

Algorithm 3 The proposed Softmax function.

Require:

y (y \in {y_{0}, \dots, y_{J - 1}})

Ensure:

O (O \in {O_{0}, \dots, O_{J - 1}})

1:
for $(k = 0; k < J; k + +)$ do
2:
$O_{k} = 0$
3:
end for
4:
$s u m = 0, c h e c k = 0$
5:
for $(k = 0; k < J; k + +)$ do
6:
$O_{k} = e x p (y_{k})$
7:
$s u m = s u m + O_{k}$
8:
end for
9:
if $(k! = J)$ then
10:
exit(1);
11:
end if
12:
for $(k = 0; k < J; k + +)$ do
13:
$O_{k} = e x p (y_{k}) / s u m$
14:
$c h e c k = c h e c k + O_{k}$
15:
end for
16:
if $(k! = J)$ then
17:
exit(1);
18:
end if
19:
if $(c h e c k! = 1)$ then
20:
exit(1);
21:
end if