Skip to main content

Table 1 An example illustrating the innerworkings of Equation 1 on an input sequence \({X = (H, W, H, W, S, H, W, H, W, R)}\). The notation \(X_{[1:i]}\) denotes the symbols in X from 1 to \(i - 1\), \(L_{i}\) denotes the shortest subsequences that starts at position i and does not appear from 1 to \(i - 1\) in the original sequence, and \(\Lambda _{i}\) is given by \(| L_{i} | \). We note that every time a new (previously unseen) symbols appears, a new subsequence is generated, as shown in the last two columns of the table

From: On estimating the predictability of human mobility: the role of routine