Declarative Process Mining for DCR Graphs

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

Standard

Declarative Process Mining for DCR Graphs. / Debois, Søren; Hildebrandt, Thomas T.; Laursen, Paw Høvsgaard; Ulrik, Kenneth Ry.

Proceedings of the Symposium on Applied Computing: SAC '17. New York, NY, USA : Association for Computing Machinery, 2017. p. 759-764.

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

Harvard

Debois, S, Hildebrandt, TT, Laursen, PH & Ulrik, KR 2017, Declarative Process Mining for DCR Graphs. in Proceedings of the Symposium on Applied Computing: SAC '17. Association for Computing Machinery, New York, NY, USA, pp. 759-764, The 32nd ACM SIGAPP Symposium On Applied Computing, 04/04/2017. https://doi.org/10.1145/3019612.3019622

APA

Debois, S., Hildebrandt, T. T., Laursen, P. H., & Ulrik, K. R. (2017). Declarative Process Mining for DCR Graphs. In Proceedings of the Symposium on Applied Computing: SAC '17 (pp. 759-764). Association for Computing Machinery. https://doi.org/10.1145/3019612.3019622

Vancouver

Debois S, Hildebrandt TT, Laursen PH, Ulrik KR. Declarative Process Mining for DCR Graphs. In Proceedings of the Symposium on Applied Computing: SAC '17. New York, NY, USA: Association for Computing Machinery. 2017. p. 759-764 https://doi.org/10.1145/3019612.3019622

Author

Debois, Søren ; Hildebrandt, Thomas T. ; Laursen, Paw Høvsgaard ; Ulrik, Kenneth Ry. / Declarative Process Mining for DCR Graphs. Proceedings of the Symposium on Applied Computing: SAC '17. New York, NY, USA : Association for Computing Machinery, 2017. pp. 759-764

Bibtex

@inproceedings{210acf37a97549c9b4c639f9c101cdc1,
title = "Declarative Process Mining for DCR Graphs",
abstract = "We investigate process mining for the declarative Dynamic Condition Response (DCR) graphs process modelling language. We contribute (a) a process mining algorithm for DCR graphs, (b) a proposal for a set of metrics quantifying output model quality, and (c) a preliminary example-based comparison with the Declare Maps Miner. The algorithm takes a contradiction-based approach, that is, we initially assume that all possible constraints hold, subsequently removing constraints as they are observed to be violated by traces in the input log.",
author = "S{\o}ren Debois and Hildebrandt, {Thomas T.} and Laursen, {Paw H{\o}vsgaard} and Ulrik, {Kenneth Ry}",
year = "2017",
doi = "10.1145/3019612.3019622",
language = "English",
isbn = "978-1-4503-4486-9",
pages = "759--764",
booktitle = "Proceedings of the Symposium on Applied Computing",
publisher = "Association for Computing Machinery",
note = "The 32nd ACM SIGAPP Symposium On Applied Computing, SAC '17 ; Conference date: 04-04-2017",

}

RIS

TY - GEN

T1 - Declarative Process Mining for DCR Graphs

AU - Debois, Søren

AU - Hildebrandt, Thomas T.

AU - Laursen, Paw Høvsgaard

AU - Ulrik, Kenneth Ry

N1 - Conference code: 32

PY - 2017

Y1 - 2017

N2 - We investigate process mining for the declarative Dynamic Condition Response (DCR) graphs process modelling language. We contribute (a) a process mining algorithm for DCR graphs, (b) a proposal for a set of metrics quantifying output model quality, and (c) a preliminary example-based comparison with the Declare Maps Miner. The algorithm takes a contradiction-based approach, that is, we initially assume that all possible constraints hold, subsequently removing constraints as they are observed to be violated by traces in the input log.

AB - We investigate process mining for the declarative Dynamic Condition Response (DCR) graphs process modelling language. We contribute (a) a process mining algorithm for DCR graphs, (b) a proposal for a set of metrics quantifying output model quality, and (c) a preliminary example-based comparison with the Declare Maps Miner. The algorithm takes a contradiction-based approach, that is, we initially assume that all possible constraints hold, subsequently removing constraints as they are observed to be violated by traces in the input log.

U2 - 10.1145/3019612.3019622

DO - 10.1145/3019612.3019622

M3 - Article in proceedings

SN - 978-1-4503-4486-9

SP - 759

EP - 764

BT - Proceedings of the Symposium on Applied Computing

PB - Association for Computing Machinery

CY - New York, NY, USA

T2 - The 32nd ACM SIGAPP Symposium On Applied Computing

Y2 - 4 April 2017

ER -

ID: 227990236