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.
Originalsprog | Engelsk |
---|---|
Titel | Proceedings of the Symposium on Applied Computing : SAC '17 |
Antal sider | 6 |
Udgivelsessted | New York, NY, USA |
Forlag | Association for Computing Machinery |
Publikationsdato | 2017 |
Sider | 759-764 |
ISBN (Trykt) | 978-1-4503-4486-9 |
DOI | |
Status | Udgivet - 2017 |
Begivenhed | The 32nd ACM SIGAPP Symposium On Applied Computing - Varighed: 4 apr. 2017 → … Konferencens nummer: 32 |
Konference
Konference | The 32nd ACM SIGAPP Symposium On Applied Computing |
---|---|
Nummer | 32 |
Periode | 04/04/2017 → … |
Emneord
- DCR graphs, declarative process mining