Towards an Entropy-Based Analysis of Log Variability
Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
Standard
Towards an Entropy-Based Analysis of Log Variability. / Back, Christoffer Olling; Debois, Soren; Slaats, Tijs.
Business Process Management Workshops: BPM 2017 International Workshops, Barcelona, Spain, September 10–11, 2017, Revised Papers. ed. / Ernest Teniente; Matthias Weidlich. Springer, 2018. p. 53-70 (Lecture Notes in Business Information Processing, Vol. 308).Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - CHAP
T1 - Towards an Entropy-Based Analysis of Log Variability
AU - Back, Christoffer Olling
AU - Debois, Soren
AU - Slaats, Tijs
N1 - Conference code: 15
PY - 2018
Y1 - 2018
N2 - Process mining algorithms can be partitioned by the type of model that they output: imperative miners output flow-diagrams showing all possible paths through a process, whereas declarative miners output constraints showing the rules governing a process. For processes with great variability, the latter approach tends to provide better results, because using an imperative miner would lead to so-called “spaghetti models” which attempt to show all possible paths and are impossible to read. However, studies have shown that one size does not fit all: many processes contain both structured and unstructured parts and therefore do not fit strictly in one category or the other. This has led to the recent introduction of hybrid miners, which aim to combine flow- and constraint-based models to provide the best possible representation of a log. In this paper we focus on a core question underlying the development of hybrid miners: given a log, can we determine a priori whether the log is best suited for imperative or declarative mining? We propose using the concept of entropy, commonly used in information theory. We consider different measures for entropy that could be applied and show through experimentation on both synthetic and real-life logs that these entropy measures do indeed give insights into the complexity of the log and can act as an indicator of which mining paradigm should be used.
AB - Process mining algorithms can be partitioned by the type of model that they output: imperative miners output flow-diagrams showing all possible paths through a process, whereas declarative miners output constraints showing the rules governing a process. For processes with great variability, the latter approach tends to provide better results, because using an imperative miner would lead to so-called “spaghetti models” which attempt to show all possible paths and are impossible to read. However, studies have shown that one size does not fit all: many processes contain both structured and unstructured parts and therefore do not fit strictly in one category or the other. This has led to the recent introduction of hybrid miners, which aim to combine flow- and constraint-based models to provide the best possible representation of a log. In this paper we focus on a core question underlying the development of hybrid miners: given a log, can we determine a priori whether the log is best suited for imperative or declarative mining? We propose using the concept of entropy, commonly used in information theory. We consider different measures for entropy that could be applied and show through experimentation on both synthetic and real-life logs that these entropy measures do indeed give insights into the complexity of the log and can act as an indicator of which mining paradigm should be used.
KW - Process mining
KW - Hybrid models
KW - Process variability Process flexibility
KW - Information theory
KW - Entropy
KW - Knowledge Work
U2 - 10.1007/978-3-319-74030-0_4
DO - 10.1007/978-3-319-74030-0_4
M3 - Book chapter
SN - 978-3-319-74029-4
T3 - Lecture Notes in Business Information Processing
SP - 53
EP - 70
BT - Business Process Management Workshops
A2 - Teniente, Ernest
A2 - Weidlich, Matthias
PB - Springer
Y2 - 10 September 2017 through 15 September 2017
ER -
ID: 202483314