Mining processes with multi-instantiation

Ingo Weber, Mostafa Farshchi, Jan Mendling, Jean-Guy Schneider

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

14 Citations (Scopus)

Abstract

Process mining, in particular discovering process models by mining event traces, is becoming a widely adopted practice. However, when the underlying process contains subprocesses which are instantiated multiple times in parallel, classical process mining techniques that assume a flat process are not directly applicable. Their application can cause one of two problems: either the mined model is overly general, allowing arbitrary order and execution frequency of activities in the sub-process, or it lacks fitness by capturing only single instantiation of sub-processes. For conformance checking, this results in a too high rate of either false positives or false negatives, respectively. In this paper, we propose an extension to well-known process mining techniques, adding the capability of handling multi-instantiated sub-processes to discovery and conformance checking. We evaluate the approach with a real-world data set.

Original languageEnglish
Title of host publication2015 Symposium on Applied Computing, SAC 2015
EditorsDongwan Shin
PublisherAssociation for Computing Machinery (ACM)
Pages1231-1237
Number of pages7
ISBN (Electronic)9781450331968
DOIs
Publication statusPublished - 13 Apr 2015
Externally publishedYes
EventACM Symposium on Applied Computing 2015 - Salamanca, Spain
Duration: 13 Apr 201517 Apr 2015
Conference number: 30th
https://www.sigapp.org/sac/sac2015/
https://dl.acm.org/doi/proceedings/10.1145/2695664 (Proceedings)

Publication series

NameProceedings of the ACM Symposium on Applied Computing
Volume13-17-April-2015

Conference

ConferenceACM Symposium on Applied Computing 2015
Abbreviated titleSAC 2015
Country/TerritorySpain
CitySalamanca
Period13/04/1517/04/15
Internet address

Keywords

  • Conformance
  • Discovery
  • Multi-instantiation
  • Process mining

Cite this