Density-based histogram of singular values for √ n ˆ L andˆNandˆ andˆN / √ n for the animal movement data in blue bars and the theoretical predictions associated with the improvement clustering with K = 10 as the red line and with K = 100 as the purple dashed line.

Density-based histogram of singular values for √ n ˆ L andˆNandˆ andˆN / √ n for the animal movement data in blue bars and the theoretical predictions associated with the improvement clustering with K = 10 as the red line and with K = 100 as the purple dashed line.

Source publication
Preprint
Full-text available
Motivated by theoretical advancements in dimensionality reduction techniques we use a recent model, called Block Markov Chains, to conduct a practical study of clustering in real-world sequential data. Clustering algorithms for Block Markov Chains possess theoretical optimality guarantees and can be deployed in sparse data regimes. Despite these fa...

Contexts in source publication

Context 1
... short: the algorithm detects geographical features and movement patterns, and the algorithm does so based on the sequential data alone, i.e., it captures behavior of the animals. Figure 7 next compares the spectral noise of (10) and (25) to the theoretical predictions for BMCs (recall Proposition 2). ...
Context 2
... example, the distribution of singular values depicted in Figure 7 is not predicted perfectly. This is likely caused by the symmetry assumption between states within a BMC, which is at odds with the geographical structure of the data. ...