Declarative Process Mining for DCR Graphs
- ,
- ,
- Paw Høvsgaard Laursen,
- Kenneth Ry Ulrik
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Research
Peer-reviewOpen access
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.
Publication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Article in proceedings
Research
Peer-reviewHost publication Subtitle
SAC '17Original language
EnglishPages from-to (Number of pages)
Pages 759-764 (6 pages)Publication milestones
- Published - 2017
Publication status
Published - 2017
Place of publication
New York, NY, USAPublisher
Association for Computing Machinery, United StatesISBN (Print)
978-1-4503-4486-9Publication IDs
- Scopus: 85020855546
Host publication title
Proceedings of the Symposium on Applied ComputingPublication metrics
PlumX, opens in new tab
Citation count
25
Captures
32
Access to documents
Final published version, 754.34 KB
Related Event
Title
The 32nd ACM SIGAPP Symposium On Applied Computing
