. 2025 Feb 28;11:e2703. doi: 10.7717/peerj-cs.2703

Algorithm 1. Pseudocode of iCCE10.

Input: ifpifs-matrix

[a_{i j}]_{m \times n}

Output: Score matrix

[s_{i 1}]_{(m - 1) \times 1}

, Optimum alternatives

[o p_{i 1}]

[μ] \leftarrow [0]_{(m - 1) \times 1}

[ν] \leftarrow [0]_{(m - 1) \times 1}

3: for i from 2 to m do

4: for j from 1 to n do

μ_{i 1} \leftarrow μ_{i 1} + a_{01 j} a_{i j 1}

ν_{i 1} \leftarrow ν_{i 1} + a_{01 j} a_{i j 2}

7: end for

s_{i 1} \leftarrow \frac{1}{n} μ_{i 1}

s_{i 2} \leftarrow \frac{1}{n} ν_{i 1}

10: end for

11:

[s v] \leftarrow [s_{i 1} - s_{i 2}]_{(m - 1) \times 1}

12:

[a v] \leftarrow [s_{i 1} + s_{i 2}]_{(m - 1) \times 1}

13: for i from 1 to

m - 1

14: if

max_{k \in I_{m - 1}} {s v_{k 1}} = 0

AND

min_{k \in I_{m - 1}} {s v_{k 1}} = 0

then

15:

d m_{i 1} \leftarrow 1

16: else

17:

d m_{i 1} \leftarrow \frac{s v_{i 1} + | min_{k \in I_{m - 1}} {s v_{k 1}} |}{max_{k \in I_{m - 1}} {s v_{k 1}} + | min_{k \in I_{m - 1}} {s v_{k 1}} |}

18: end if

19: end for

20:

[o p] \leftarrow \underset{k \in I_{m - 1}}{a r g m a x} {s v_{k 1}}