A modern approach to transition analysis and process mining with Markov models: A tutorial with R

• URL: http://arxiv.org/abs/2309.08558v1
• Date: Sat, 2 Sep 2023 07:24:32 GMT
• Title: A modern approach to transition analysis and process mining with Markov models: A tutorial with R
• Authors: Jouni Helske, Satu Helske, Mohammed Saqr, Sonsoles L\'opez-Pernas, Keefe Murphy
• Abstract summary: The chapter provides an introduction to this method and differentiates between its most common variations. In addition to a thorough explanation and contextualization within the existing literature, the chapter provides a step-by-step tutorial on how to implement each type of Markovian model.
• Score: 0.9699640804685629
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This chapter presents an introduction to Markovian modeling for the analysis of sequence data. Contrary to the deterministic approach seen in the previous sequence analysis chapters, Markovian models are probabilistic models, focusing on the transitions between states instead of studying sequences as a whole. The chapter provides an introduction to this method and differentiates between its most common variations: first-order Markov models, hidden Markov models, mixture Markov models, and mixture hidden Markov models. In addition to a thorough explanation and contextualization within the existing literature, the chapter provides a step-by-step tutorial on how to implement each type of Markovian model using the R package seqHMM. The chaper also provides a complete guide to performing stochastic process mining with Markovian models as well as plotting, comparing and clustering different process models.

Related papers

• A Probabilistic Semi-Supervised Approach with Triplet Markov Chains [1.000779758350696]
  Triplet Markov chains are general generative models for sequential data. We propose a general framework based on a variational Bayesian inference to train parameterized triplet Markov chain models.
  arXiv  Detail & Related papers  (2023-09-07T13:34:20Z)
• Information Theory Inspired Pattern Analysis for Time-series Data [60.86880787242563]
  We propose a highly generalizable method that uses information theory-based features to identify and learn from patterns in time-series data. For applications with state transitions, features are developed based on Shannon's entropy of Markov chains, entropy rates of Markov chains, and von Neumann entropy of Markov chains. The results show the proposed information theory-based features improve the recall rate, F1 score, and accuracy on average by up to 23.01% compared with the baseline models.
  arXiv  Detail & Related papers  (2023-02-22T21:09:35Z)
• Score-based Continuous-time Discrete Diffusion Models [102.65769839899315]
  We extend diffusion models to discrete variables by introducing a Markov jump process where the reverse process denoises via a continuous-time Markov chain. We show that an unbiased estimator can be obtained via simple matching the conditional marginal distributions. We demonstrate the effectiveness of the proposed method on a set of synthetic and real-world music and image benchmarks.
  arXiv  Detail & Related papers  (2022-11-30T05:33:29Z)
• DiffusER: Discrete Diffusion via Edit-based Reconstruction [88.62707047517914]
  DiffusER is an edit-based generative model for text based on denoising diffusion models. It can rival autoregressive models on several tasks spanning machine translation, summarization, and style transfer. It can also perform other varieties of generation that standard autoregressive models are not well-suited for.
  arXiv  Detail & Related papers  (2022-10-30T16:55:23Z)
• Fitting Sparse Markov Models to Categorical Time Series Using Regularization [0.0]
  A more general approach is called Sparse Markov Model (SMM), where all possible histories of order $m$ form a partition. We develop an elegant method of fitting SMM using convex clustering, which involves regularization. We apply this method to classify genome sequences, obtained from individuals affected by different viruses.
  arXiv  Detail & Related papers  (2022-02-11T07:27:16Z)
• Ensemble Learning For Mega Man Level Generation [2.6402344419230697]
  We investigate the use of ensembles of Markov chains for procedurally generating emphMega Man levels. We evaluate it on measures of playability and stylistic similarity in comparison to a non-ensemble, existing Markov chain approach.
  arXiv  Detail & Related papers  (2021-07-27T00:16:23Z)
• Equivalence of Segmental and Neural Transducer Modeling: A Proof of Concept [56.46135010588918]
  We prove that the widely used class of RNN-Transducer models and segmental models (direct HMM) are equivalent. It is shown that blank probabilities translate into segment length probabilities and vice versa.
  arXiv  Detail & Related papers  (2021-04-13T11:20:48Z)
• Autoregressive Asymmetric Linear Gaussian Hidden Markov Models [1.332091725929965]
  Asymmetric hidden Markov models provide a framework where the trend of the process can be expressed as a latent variable. We show how inference, hidden states decoding and parameter learning must be adapted to fit the proposed model.
  arXiv  Detail & Related papers  (2020-10-27T08:58:46Z)
• Improving the Reconstruction of Disentangled Representation Learners via Multi-Stage Modeling [54.94763543386523]
  Current autoencoder-based disentangled representation learning methods achieve disentanglement by penalizing the ( aggregate) posterior to encourage statistical independence of the latent factors. We present a novel multi-stage modeling approach where the disentangled factors are first learned using a penalty-based disentangled representation learning method. Then, the low-quality reconstruction is improved with another deep generative model that is trained to model the missing correlated latent variables.
  arXiv  Detail & Related papers  (2020-10-25T18:51:15Z)
• Document Ranking with a Pretrained Sequence-to-Sequence Model [56.44269917346376]
  We show how a sequence-to-sequence model can be trained to generate relevance labels as "target words" Our approach significantly outperforms an encoder-only model in a data-poor regime.
  arXiv  Detail & Related papers  (2020-03-14T22:29:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.