paper-with-me

홈 › Papers

Process Discovery using Classification Tree Hidden Semi-Markov Model

2018-07-12 · Yihuang Kang, Vladimir Zadorozhny

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?"

📄 PDF Abstract BibTeX arXiv:1807.04415

Code (0)

등록된 구현이 없습니다.

Tasks

ClassificationGeneral Classification

Similar Papers 제목 키워드 기반

Toward Transparent Sequence Models with Model-Based Tree Markov Model

2023-07-28 · Chan Hsu, Wei-Chun Huang, Jun-Ting Wu, Chih-Yuan Li 외

In this study, we address the interpretability issue in complex, black-box Machine Learning models applied to sequence data. We introduce the Model-Based tree Hidden Semi-Markov Model (MOB-HSMM), an inherently interpreta…

model

CNC-TP: Classifier Nominal Concept Based on Top-Pertinent Attributes

2026-01-05 · Yasmine Souissi, Fabrice Boissier, Nida Meddouri arxiv

Knowledge Discovery in Databases (KDD) aims to exploit the vast amounts of data generated daily across various domains of computer applications. Its objective is to extract hidden and meaningful knowledge from datasets t…

N-ary Constituent Tree Parsing with Recursive Semi-Markov Model

2021-07-26 · ACL 2021 5 · Xin Xin, Jinlong Li, Zeqi Tan

In this paper, we study the task of graph-based constituent parsing in the setting that binarization is not conducted as a pre-processing step, where a constituent tree may consist of nodes with more than two children. P…

BinarizationConstituency Parsing

Optimal Pattern Detection Tree for Symbolic Rule-Based Classification

2026-05-14 · Young-Chae Hong, Yangho Chen arxiv

Pattern discovery in data plays a crucial role across diverse domains, including healthcare, risk assessment, and machinery maintenance. In contrast to black-box deep learning models, symbolic rule discovery emerges as a…

Binary Classification

Literature Based Discovery (LBD): Towards Hypothesis Generation and Knowledge Discovery in Biomedical Text Mining

2023-10-04 · Balu Bhasuran, Gurusamy Murugesan, Jeyakumar Natarajan

Biomedical knowledge is growing in an astounding pace with a majority of this knowledge is represented as scientific publications. Text mining tools and methods represents automatic approaches for extracting hidden patte…