# Process Discovery using Classification Tree Hidden Semi-Markov Model

arXiv: https://arxiv.org/abs/1807.04415 · HTML: https://mlsanity.com/paper/1807.04415/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 Jul 2018.

## Built on by (most cited first, 2 of 2)

- [An IIoT machine model for achieving consistency in product quality in manufacturing plants](https://mlsanity.com/paper/2109.12964/) (2021)
- [Toward Transparent Sequence Models with Model-Based Tree Markov Model](https://mlsanity.com/paper/2307.15367/) (2023)

## Abstract (arXiv)

Various and ubiquitous information systems are being used in monitoring, exchanging, and collecting information. These systems are generating massive amount of event sequence logs that may help us understand underlying phenomenon. By analyzing these logs, we can learn process models that describe system procedures, predict the development of the system, or check whether the changes are expected. In this paper, we consider a novel technique that models these sequences of events in temporal-probabilistic manners. Specifically, we propose a probabilistic process model that combines hidden semi-Markov model and classification trees learning. Our experimental result shows that the proposed approach can answer a kind of question-"what are the most frequent sequence of system dynamics relevant to a given sequence of observable events?". For example, "Given a series of medical treatments, what are the most relevant patients' health condition pattern changes at different times?"