Algorithm 1 Local region evaluation algorithm based on node credibility (LREA)

Input: multiple node assessment results $\{d_i^j|i=1,2,\cdots ,len(r_j)\}$, the iteration error threshold $ϵ$ Output: single region evaluation result $d^j$, node credibility ${\omega }^j$

1: INITIALIZE ${\omega }^j$, $d^j(0)$, $d^j(1)$//Initialize node credibility and the single region evaluation result

2: $t=1$           //Rounds of iteration

3: WHILE $\sqrt{\Vert d^j(t)-d^j(t-1){\Vert }^2}\ge ϵ$  //Compute and define iteration error

4:    $d^j(t+1)={\displaystyle \sum {\omega }_i^j(t)d_i^j}/{\displaystyle \sum {\omega }_i^j}(t)$  //Update single region evaluation result

5:    ${\omega }_i^j(t+1)=\ln \left({\displaystyle \sum \parallel d_i^j-d^j(t){\parallel }^2}/\parallel d_i^j-d^j(t){\parallel }^2\right)$  //Update node credibility

6:    $t=t+1$

7:    ${\omega }^j=\{{\omega }_i^0(t),{\omega }_i^1(t),\cdots ,{\omega }_i^{len(r_j)}(t)\}$  //Save node credibility

8:    $d^j=d^j(t)$   //Save single region evaluation result

9: END WHILE

10: Return ${\omega }^j$, $d^j$