  This work is devoted to the clustering of check-in sequences from a geosocial
network. We used the mixture Markov chain process as a mathematical model for
time-dependent types of data. For clustering, we adjusted the
Expectation-Maximization (EM) algorithm. As a result, we obtained highly
detailed communities (clusters) of users of the now defunct geosocial network,
Weeplaces.

Social and Information Networks;Computers and Society;Machine Learning