Skip to main content
. 2014 Apr 9;14(4):6584–6605. doi: 10.3390/s140406584

Algorithm 2: DEUDSC ( )

1) Input: Y, k, λ, {ci},{dsj} (0 ≤ jN) {N ∈ Z∣0 ≤ N ≤ 3}
2) Output: dc
3)  while (1)
4) new input Y
5)  ({Ui},{ci})=FCM(Y, k, λ,{cj})
6) find maximum Ui, Um, Un
7) dc = Ui × dsi + Um × dsm + Un × dsn
8) return dc
9) End