Algorithm 4: Algorithm for Next Location Prediction.

Input: ${\Sigma }_D,s_A$  Output: $p^{*}$ 1$s_A^c$ = symbol at the last position of $s_A$. 2$s_A^p$ = sequence preceding $s_A^c$ in $s_A$. 3Find $\sigma =(s^p,s^c,s^s,u)$ with the highest p-$sim(s^p,s_A^p)$ s.t. $s^c\ni s_A^c$ ; $\forall \sigma \in {\Sigma }_D$ 4The ties are broken by picking σ with the highest u. 5$p^{*}\leftarrow \text{place} p \text{of} s^s$