Declarative Process Mining for DCR Graphs

Søren Debois, Thomas T. Hildebrandt, Paw Høvsgaard Laursen, Kenneth Ry Ulrik

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

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.
OriginalsprogEngelsk
TitelProceedings of the Symposium on Applied Computing : SAC '17
Antal sider6
UdgivelsesstedNew York, NY, USA
ForlagAssociation for Computing Machinery
Publikationsdato2017
Sider759-764
ISBN (Trykt)978-1-4503-4486-9
DOI
StatusUdgivet - 2017
BegivenhedThe 32nd ACM SIGAPP Symposium On Applied Computing -
Varighed: 4 apr. 2017 → …
Konferencens nummer: 32

Konference

KonferenceThe 32nd ACM SIGAPP Symposium On Applied Computing
Nummer32
Periode04/04/2017 → …

Emneord

  • DCR graphs, declarative process mining

Fingeraftryk

Dyk ned i forskningsemnerne om 'Declarative Process Mining for DCR Graphs'. Sammen danner de et unikt fingeraftryk.

Citationsformater