Process discovery is the task of generating process models from event logs. Mining processes that operate in an environment of high variability is an ongoing research challenge because various algorithms tend to produce spaghetti-like process models. This is particularly the case when procedural models are generated. A promising direction to tackle this challenge is the usage of declarative process modelling languages like Declare, which summarise complex behaviour in a compact set of behavioural constraints on activities. A Declare constraint is branched when one of its parameters is the disjunction of two or more activities. For example, branched Declare can be used to express rules like "in a bank, a mortgage application is always eventually followed by a notification to the applicant by phone or by a notification by e-mail". However, branched Declare constraints are expensive to be discovered. In addition, it is often the case that hundreds of branched Declare constraints are valid for the same log, thus making, again, the discovery results unreadable. In this paper, we address these problems from a theoretical angle. More specifically, we define the class of Target-Branched Declare constraints and investigate the formal properties it exhibits. Furthermore, we present a technique for the efficient discovery of compact Target-Branched Declare models. We discuss the merits of our work through an evaluation based on a prototypical implementation using both artificial and real-life event logs.

Efficient discovery of Target-Branched Declare constraints / Di Ciccio, C.; Maggi, F. M.; Mendling, J.. - In: INFORMATION SYSTEMS. - ISSN 0306-4379. - 56:(2016), pp. 258-283. [10.1016/j.is.2015.06.009]

Efficient discovery of Target-Branched Declare constraints

Di Ciccio C.
;
Maggi F. M.;
2016

Abstract

Process discovery is the task of generating process models from event logs. Mining processes that operate in an environment of high variability is an ongoing research challenge because various algorithms tend to produce spaghetti-like process models. This is particularly the case when procedural models are generated. A promising direction to tackle this challenge is the usage of declarative process modelling languages like Declare, which summarise complex behaviour in a compact set of behavioural constraints on activities. A Declare constraint is branched when one of its parameters is the disjunction of two or more activities. For example, branched Declare can be used to express rules like "in a bank, a mortgage application is always eventually followed by a notification to the applicant by phone or by a notification by e-mail". However, branched Declare constraints are expensive to be discovered. In addition, it is often the case that hundreds of branched Declare constraints are valid for the same log, thus making, again, the discovery results unreadable. In this paper, we address these problems from a theoretical angle. More specifically, we define the class of Target-Branched Declare constraints and investigate the formal properties it exhibits. Furthermore, we present a technique for the efficient discovery of compact Target-Branched Declare models. We discuss the merits of our work through an evaluation based on a prototypical implementation using both artificial and real-life event logs.
2016
Declarative process; Knowledge discovery; Process mining
01 Pubblicazione su rivista::01a Articolo in rivista
Efficient discovery of Target-Branched Declare constraints / Di Ciccio, C.; Maggi, F. M.; Mendling, J.. - In: INFORMATION SYSTEMS. - ISSN 0306-4379. - 56:(2016), pp. 258-283. [10.1016/j.is.2015.06.009]
File allegati a questo prodotto
File Dimensione Formato  
DiCiccio_Preprint_Efficient-discovery_2016.pdf

accesso aperto

Note: https://doi.org/10.1016/j.is.2015.06.009
Tipologia: Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 832.88 kB
Formato Adobe PDF
832.88 kB Adobe PDF
DiCiccio_Efficient-discovery_2016.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 3.18 MB
Formato Adobe PDF
3.18 MB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1352729
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 42
  • ???jsp.display-item.citation.isi??? 32
social impact