Discovering block-structured process models from incomplete event logs

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

68 Citations (Scopus)
1 Downloads (Pure)

Abstract

One of the main challenges in process mining is to discover a process model describing observed behaviour in the best possible manner. Since event logs only contain example behaviour and one cannot assume to have seen all possible process executions, process discovery techniques need to be able to handle incompleteness. In this paper, we study the effects of such incomplete logs on process discovery. We analyse the impact of incompleteness of logs on behavioural relations, which are abstractions often used by process discovery techniques. We introduce probabilistic behavioural relations that are less sensitive to incompleteness, and exploit these relations to provide a more robust process discovery algorithm. We prove this algorithm to be able to rediscover a model of the original system. Furthermore, we show in experiments that our approach even rediscovers models from incomplete event logs that are much smaller than required by other process discovery algorithms.
Original languageEnglish
Title of host publicationApplication and Theory of Petri Nets and Concurrency (35th International Conference, Petri Nets 2014, Tunis, Tunesia, June 23-27, 2014. Proceedings)
EditorsG. Ciardo, E. Kindler
Place of PublicationBerlin
PublisherSpringer
Pages91-110
ISBN (Print)978-3-319-07733-8
DOIs
Publication statusPublished - 2014
Event35th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2014), June 23-27, 2014, Tunis, Tunesia - Tunis, Tunisia
Duration: 23 Jun 201427 Jun 2014
http://petrinets2014.cnam.fr/petrinets.php

Publication series

NameLecture Notes in Computer Science
Volume8489
ISSN (Print)0302-9743

Conference

Conference35th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2014), June 23-27, 2014, Tunis, Tunesia
Abbreviated titlePetri Nets 2014
CountryTunisia
CityTunis
Period23/06/1427/06/14
OtherConference co-located with the 14th International Conference on Application of Concurrency to System Design (ACSD 2014)
Internet address

Fingerprint Dive into the research topics of 'Discovering block-structured process models from incomplete event logs'. Together they form a unique fingerprint.

  • Cite this

    Leemans, S. J. J., Fahland, D., & Aalst, van der, W. M. P. (2014). Discovering block-structured process models from incomplete event logs. In G. Ciardo, & E. Kindler (Eds.), Application and Theory of Petri Nets and Concurrency (35th International Conference, Petri Nets 2014, Tunis, Tunesia, June 23-27, 2014. Proceedings) (pp. 91-110). (Lecture Notes in Computer Science; Vol. 8489). Springer. https://doi.org/10.1007/978-3-319-07734-5_6