Logo Logo
Hilfe
Hilfe
Switch Language to English

Augusto, Adriano; Mendling, Jan ORCID logoORCID: https://orcid.org/0000-0002-7260-524X; Vidgof, Maxim ORCID logoORCID: https://orcid.org/0000-0003-2394-2247 und Wurm, Bastian ORCID logoORCID: https://orcid.org/0000-0002-1002-5397 (Juni 2022): The connection between process complexity of event sequences and models discovered by process mining. In: Information Sciences, Bd. 598: S. 196-215 [PDF, 667kB]

Abstract

Process mining is a research area focusing on the design of algorithms that can auto-matically provide insights into business processes. Among the most popular algorithms are those for automated process discovery, which have the ultimate goal to generate a process model that summarizes the behavior recorded in an event log. Past research had the aim to improve process discovery algorithms irrespective of the characteristics of the input log. In this paper, we take a step back and investigate the connection between measures capturing characteristics of the input event log and the quality of the discov-ered process models. To this end, we review the state-of-the-art process complexity measures, propose a new process complexity measure based on graph entropy, and ana-lyze this set of complexity measures on an extensive collection of event logs and corre-sponding automatically discovered process models. Our analysis shows that many process complexity measures correlate with the quality of the discovered process mod-els, demonstrating the potential of using complexity measures as predictors of process model quality. This finding is important for process mining research, as it highlights that not only algorithms, but also connections between input data and output quality should be studied.

Dokument bearbeiten Dokument bearbeiten