Directed acyclic graph extraction from event logs

5Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The usage of probabilistic models in business process mining enables analysis of business processes in a more efficient manner. Although, the Bayesian belief network is one of the most common probabilistic models, possibilities to use it in business process mining are still not widely researched. Existing process mining approaches are incapable to extract directed acyclic graphs for representing Bayesian networks. This paper presents an approach for extraction of directed acyclic graph from event logs. The results obtained during the experiment show that the proposed approach is feasible and may be applied in practice.

Cite

CITATION STYLE

APA

Vasilecas, O., Savickas, T., & Lebedys, E. (2014). Directed acyclic graph extraction from event logs. Communications in Computer and Information Science, 465, 172–181. https://doi.org/10.1007/978-3-319-11958-8_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free