ITU

Entropy as a Measure of Log Variability

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

Standard

Entropy as a Measure of Log Variability. / Back, Christoffer Olling; Debois, Søren; Slaats, Tijs.

In: Journal on Data Semantics, 14.06.2019, p. 1-28.

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

Harvard

APA

Vancouver

Author

Back, Christoffer Olling ; Debois, Søren ; Slaats, Tijs. / Entropy as a Measure of Log Variability. In: Journal on Data Semantics. 2019 ; pp. 1-28.

Bibtex

@article{de23a365b22d4ceba1b75f3d4408fda2,
title = "Entropy as a Measure of Log Variability",
abstract = "Process mining algorithms fall in two classes: imperative miners output flow diagrams, showing all possible paths, whereas declarative miners output constraints, showing the rules governing a process. But given a log, how do we know which of the two to apply? Assuming that logs exhibiting a large degree of variability are more suited for declarative miners, we can attempt to answer this question by defining a suitable measure of the variability of the log. This paper reports on an exploratory study into the use of entropy measures as metrics of variability. We survey notions of entropy used, e.g. in physics; we propose variant notions likely more suitable for the field of process mining; we provide an implementation of every entropy notion discussed; and we report entropy measures for a collection of both synthetic and real-life logs. Finally, based on anecdotal indications of which logs are better suited for declarative/imperative mining, we identify the most promising measures for future studies. For estimating overall entropy, global block and k-nearest neighbour estimators of entropy appear most promising and excel at identifying noise in logs. For estimating entropy rate we identify Lempel–Ziv and certain variants of k-block estimators performing well, and note that the former is more stable, but sensitive to noise, while the latter is less stable, being sensitive to cut-off constraints determining block size.",
author = "Back, {Christoffer Olling} and S{\o}ren Debois and Tijs Slaats",
year = "2019",
month = jun,
day = "14",
doi = "10.1007/s13740-019-00105-3",
language = "English",
pages = "1--28",
journal = "Journal on Data Semantics",
issn = "1861-2032",
publisher = "Springer Verlag",

}

RIS

TY - JOUR

T1 - Entropy as a Measure of Log Variability

AU - Back, Christoffer Olling

AU - Debois, Søren

AU - Slaats, Tijs

PY - 2019/6/14

Y1 - 2019/6/14

N2 - Process mining algorithms fall in two classes: imperative miners output flow diagrams, showing all possible paths, whereas declarative miners output constraints, showing the rules governing a process. But given a log, how do we know which of the two to apply? Assuming that logs exhibiting a large degree of variability are more suited for declarative miners, we can attempt to answer this question by defining a suitable measure of the variability of the log. This paper reports on an exploratory study into the use of entropy measures as metrics of variability. We survey notions of entropy used, e.g. in physics; we propose variant notions likely more suitable for the field of process mining; we provide an implementation of every entropy notion discussed; and we report entropy measures for a collection of both synthetic and real-life logs. Finally, based on anecdotal indications of which logs are better suited for declarative/imperative mining, we identify the most promising measures for future studies. For estimating overall entropy, global block and k-nearest neighbour estimators of entropy appear most promising and excel at identifying noise in logs. For estimating entropy rate we identify Lempel–Ziv and certain variants of k-block estimators performing well, and note that the former is more stable, but sensitive to noise, while the latter is less stable, being sensitive to cut-off constraints determining block size.

AB - Process mining algorithms fall in two classes: imperative miners output flow diagrams, showing all possible paths, whereas declarative miners output constraints, showing the rules governing a process. But given a log, how do we know which of the two to apply? Assuming that logs exhibiting a large degree of variability are more suited for declarative miners, we can attempt to answer this question by defining a suitable measure of the variability of the log. This paper reports on an exploratory study into the use of entropy measures as metrics of variability. We survey notions of entropy used, e.g. in physics; we propose variant notions likely more suitable for the field of process mining; we provide an implementation of every entropy notion discussed; and we report entropy measures for a collection of both synthetic and real-life logs. Finally, based on anecdotal indications of which logs are better suited for declarative/imperative mining, we identify the most promising measures for future studies. For estimating overall entropy, global block and k-nearest neighbour estimators of entropy appear most promising and excel at identifying noise in logs. For estimating entropy rate we identify Lempel–Ziv and certain variants of k-block estimators performing well, and note that the former is more stable, but sensitive to noise, while the latter is less stable, being sensitive to cut-off constraints determining block size.

U2 - 10.1007/s13740-019-00105-3

DO - 10.1007/s13740-019-00105-3

M3 - Journal article

SP - 1

EP - 28

JO - Journal on Data Semantics

JF - Journal on Data Semantics

SN - 1861-2032

ER -

ID: 84222896