Algorithm 2. The CWC computing algorithm.

Input: a binary mobility intention sequence X, the true periodicity T0

Output: the CWC’s value of the binary mobility intention sequence X.

1:  $CW{C}_{out}=T_0$, $C_f=1$

2: compute $S_i(T_0)$ as Eq. (6)

3: Sort $S_i(T_0)$ by descending

4: while $S_i(T_0)>0$ do

5:   compute icp as Eq. (16)

6:   compute niw as Eq. (18)

7:   compute cwc as Eq. (17)

8:   if $cwc<CW{C}_{out}$ then

9:      $CW{C}_{out}=cwc$

10:  end if

11: end while

12: return CWCout