Towards an Empirical Evaluation of Imperative and Declarative Process Mining

Christoffer Olling Back; Søren Debois; Tijs Slaats

doi:10.1007/978-3-030-01391-2_24

Towards an Empirical Evaluation of Imperative and Declarative Process Mining

Christoffer Olling Back, Søren Debois, Tijs Slaats

5 Citations (Scopus)

Abstract

Process modelling notations fall in two broad categories: declarative notations, which specify the rules governing a process; and imperative notations, which specify the flows admitted by a process. We outline an empirical approach to addressing the question of whether certain process logs are better suited for mining to imperative than declarative notations. We plan to attack this question by applying a flagship imperative and declarative miner to a standard collection of process logs, then evaluate the quality of the output models w.r.t. the standard model metrics of precision and generalisation. This approach requires perfect fitness of the output model, which substantially narrows the field of available miners; possible candidates include Inductive Miner and MINERful. With the metrics in hand, we propose to statistically evaluate the hypotheses that (1) one miner consistently outperforms the other on one of the metrics, and (2) there exist subsets of logs more suitable for imperative respectively declarative mining.

Original language	English
Title of host publication	Advances in Conceptual Modelling : ER 2018 Workshops Emp-ER, MoBiD, MREBA, QMMQ, SCME Xi’an, China, October 22–25, 2018 Proceedings
Number of pages	8
Publisher	Springer
Publication date	2018
Pages	191-198
Article number	Chapter 24
ISBN (Print)	978-3-030-01390-5
ISBN (Electronic)	978-3-030-01391-2
DOIs	https://doi.org/10.1007/978-3-030-01391-2_24
Publication status	Published - 2018
Event	37th International Conference on Conceptual Modeling - Xi'an, China Duration: 22 Oct 2018 → 25 Oct 2018

Conference

Conference	37th International Conference on Conceptual Modeling
Country/Territory	China
City	Xi'an
Period	22/10/2018 → 25/10/2018

Series	Lecture Notes in Computer Science
Volume	11158
ISSN	0302-9743

Access to Document

10.1007/978-3-030-01391-2_24

Cite this

Back, C. O., Debois, S., & Slaats, T. (2018). Towards an Empirical Evaluation of Imperative and Declarative Process Mining. In Advances in Conceptual Modelling: ER 2018 Workshops Emp-ER, MoBiD, MREBA, QMMQ, SCME Xi’an, China, October 22–25, 2018 Proceedings (pp. 191-198). [Chapter 24] Springer. Lecture Notes in Computer Science Vol. 11158 https://doi.org/10.1007/978-3-030-01391-2_24

Towards an Empirical Evaluation of Imperative and Declarative Process Mining. / Back, Christoffer Olling; Debois, Søren; Slaats, Tijs.

Advances in Conceptual Modelling: ER 2018 Workshops Emp-ER, MoBiD, MREBA, QMMQ, SCME Xi’an, China, October 22–25, 2018 Proceedings. Springer, 2018. p. 191-198 Chapter 24 (Lecture Notes in Computer Science, Vol. 11158).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Back, CO, Debois, S & Slaats, T 2018, Towards an Empirical Evaluation of Imperative and Declarative Process Mining. in Advances in Conceptual Modelling: ER 2018 Workshops Emp-ER, MoBiD, MREBA, QMMQ, SCME Xi’an, China, October 22–25, 2018 Proceedings., Chapter 24, Springer, Lecture Notes in Computer Science, vol. 11158, pp. 191-198, 37th International Conference on Conceptual Modeling, Xi'an, China, 22/10/2018. https://doi.org/10.1007/978-3-030-01391-2_24

@inproceedings{84dc6d9de7cf4514bd7ffab094c05766,

title = "Towards an Empirical Evaluation of Imperative and Declarative Process Mining",

abstract = "Process modelling notations fall in two broad categories: declarative notations, which specify the rules governing a process; and imperative notations, which specify the flows admitted by a process. We outline an empirical approach to addressing the question of whether certain process logs are better suited for mining to imperative than declarative notations. We plan to attack this question by applying a flagship imperative and declarative miner to a standard collection of process logs, then evaluate the quality of the output models w.r.t. the standard model metrics of precision and generalisation. This approach requires perfect fitness of the output model, which substantially narrows the field of available miners; possible candidates include Inductive Miner and MINERful. With the metrics in hand, we propose to statistically evaluate the hypotheses that (1) one miner consistently outperforms the other on one of the metrics, and (2) there exist subsets of logs more suitable for imperative respectively declarative mining.",

author = "Back, {Christoffer Olling} and S{\o}ren Debois and Tijs Slaats",

year = "2018",

doi = "10.1007/978-3-030-01391-2_24",

language = "English",

isbn = "978-3-030-01390-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "191--198",

booktitle = "Advances in Conceptual Modelling",

note = "37th International Conference on Conceptual Modeling, ER 2018 ; Conference date: 22-10-2018 Through 25-10-2018",

}

TY - GEN

T1 - Towards an Empirical Evaluation of Imperative and Declarative Process Mining

AU - Back, Christoffer Olling

AU - Debois, Søren

AU - Slaats, Tijs

PY - 2018

Y1 - 2018

N2 - Process modelling notations fall in two broad categories: declarative notations, which specify the rules governing a process; and imperative notations, which specify the flows admitted by a process. We outline an empirical approach to addressing the question of whether certain process logs are better suited for mining to imperative than declarative notations. We plan to attack this question by applying a flagship imperative and declarative miner to a standard collection of process logs, then evaluate the quality of the output models w.r.t. the standard model metrics of precision and generalisation. This approach requires perfect fitness of the output model, which substantially narrows the field of available miners; possible candidates include Inductive Miner and MINERful. With the metrics in hand, we propose to statistically evaluate the hypotheses that (1) one miner consistently outperforms the other on one of the metrics, and (2) there exist subsets of logs more suitable for imperative respectively declarative mining.

AB - Process modelling notations fall in two broad categories: declarative notations, which specify the rules governing a process; and imperative notations, which specify the flows admitted by a process. We outline an empirical approach to addressing the question of whether certain process logs are better suited for mining to imperative than declarative notations. We plan to attack this question by applying a flagship imperative and declarative miner to a standard collection of process logs, then evaluate the quality of the output models w.r.t. the standard model metrics of precision and generalisation. This approach requires perfect fitness of the output model, which substantially narrows the field of available miners; possible candidates include Inductive Miner and MINERful. With the metrics in hand, we propose to statistically evaluate the hypotheses that (1) one miner consistently outperforms the other on one of the metrics, and (2) there exist subsets of logs more suitable for imperative respectively declarative mining.

U2 - 10.1007/978-3-030-01391-2_24

DO - 10.1007/978-3-030-01391-2_24

M3 - Article in proceedings

SN - 978-3-030-01390-5

T3 - Lecture Notes in Computer Science

SP - 191

EP - 198

BT - Advances in Conceptual Modelling

PB - Springer

T2 - 37th International Conference on Conceptual Modeling

Y2 - 22 October 2018 through 25 October 2018

ER -

Towards an Empirical Evaluation of Imperative and Declarative Process Mining

Abstract

Conference

Access to Document

Fingerprint

Cite this