Evaluation of Clustering Algorithms on GPU-Based Edge Computing Platforms

. 2020 Nov 6;20(21):6335. doi: 10.3390/s20216335

Algorithm 3

C a l c u l a t e_P r o t o t y p e s ()

of FM algorithm.

1:
for $k = 1; k < n; k = k + 1$ do
2:
$v_{(0)} = x_{k}$ , $t = 0$ , $E_{(0)} = 1$
3:
while $E_{(t)} \geq ε_{1}$ do
4:
$t = t + 1$
5:
$μ_{x v} = \frac{1}{1 + r^{2} \cdot d_{x v}^{2}}$ , using $v_{(t - 1)}$
6:
$v_{(t)} =$ $\frac{\sum_{x \in X} {(μ_{x v}^{(t)})}^{2} \cdot x}{{(μ_{x v}^{(t)})}^{2}}$
7:
$E_{(t)} = \sum_{α = 1}^{F} (v_{(t)}^{α} - v_{(t - 1)}^{α})$
8:
end while
9:
if $\sum_{α}^{F} (v^{α} - w^{α}) > ε_{2}$ , $\forall w \in V$ then
10:
$V \equiv V + \{v\}$ .
11:
end if
12:
end for