Clustering of check-in sequences using the mixture Markov chain process

06/16/2021
by   Elena Shmileva, et al.
0

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.

READ FULL TEXT
research
07/06/2021

Neural Mixture Models with Expectation-Maximization for End-to-end Deep Clustering

Any clustering algorithm must synchronously learn to model the clusters ...
research
12/12/2019

The Metagenomic Binning Problem: Clustering Markov Sequences

The goal of metagenomics is to study the composition of microbial commun...
research
03/08/2022

Finding Many Sparse Cuts Using Entropy Maximization

A randomized algorithm for finding sparse cuts is given which is based o...
research
04/21/2016

Markov models for ocular fixation locations in the presence and absence of colour

We propose to model the fixation locations of the human eye when observi...
research
08/05/2018

Simulating Raga Notes with a Markov Chain of Order 1-2

Semi Natural Algorithmic composition (SNCA) is the technique of using al...
research
07/09/2017

Unified Method for Markov Chain Transition Model Estimation Using Incomplete Survey Data

The Future Elderly Model and related microsimulations are modeled as Mar...
research
10/02/2014

Mapping Energy Landscapes of Non-Convex Learning Problems

In many statistical learning problems, the target functions to be optimi...

Please sign up or login with your details

Forgot password? Click here to reset