Browse by author
Lookup NU author(s): Dr Andrey Mokhov
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Process mining techniques rely on event logs: the extraction of a process model (discovery) takes an event log as the input, the adequacy of a process model (conformance) is checked against an event log, and the enhancement of a process model is performed by using available data in the log. Several notations and formalisms for event log representation have been proposed in the recent years to enable efficient algorithms for the aforementioned process mining problems. In this paper we show how Conditional Partial Order Graphs (CPOGs), a recently introduced formalism for compact representation of families of partial orders, can be used in the process mining field, in particular for addressing the problem of compact and easy-to-comprehend visualisation of event logs with data. We present algorithms for extracting both the control flow as well as the relevant data parameters from a given event log and show how CPOGs can be used for efficient and effective visualisation of the obtained results. We demonstrate that the resulting representation can be used to reveal the hidden interplay between the control and data flows of a process, thereby opening way for new process mining techniques capable of exploiting this interplay.
Author(s): Mokhov A, Carmona J
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: CEUR Workshop Proceedings. Algorithms & Theories for the Analysis of Event Data
Year of Conference: 2015
Pages: 16-30
Online publication date: 25/06/2015
Acceptance date: 01/01/1900
ISSN: 1613-0073
Publisher: CEUR-WS
URL: http://ceur-ws.org/Vol-1371/
