Skip to main content
. 2023 Jan 19;25(2):201. doi: 10.3390/e25020201
Algorithm 1: Variable-Order Markov Model Prediction
Input: LU, T, k
Output: Z′
1: Z′ = ∅;
2: while length (Z′) < k − 1 do
3:         if length(LU) == 0
4:             return Z′;
5:             break;
6:         while find (T, LU) return false do
7:                 LU = delete the earliest position point of LU;
8:         m = length(LU);
9:         Z′ = use m-order Markov model to predict all possible location points;
10:       if num(Z′) ≥ k − 1
11:           return Z′;
12:           break;
13:       else
14:                 LU = delete the earliest position point of LU;