Simplifying Mined Process Models: An Approach Based on Unfoldings
Lecture notes in computer sciencePublished 1 January 2011
Dirk Fahland, Wil M. P. van der Aalst
Citations20
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents a post-processing approach to simplify discovered process models while controlling the balance between overfitting and underfitting.
Abstract
Process models discovered using process mining tend to be complex and have problems balancing between overfitting and underfitting. Overfitting models are not general enough while underfitting models allow for too much behavior. This paper presents a post-processing approach to simplify discovered process models while controlling the balance between overfitting and underfitting. The discovered process model, expressed in terms of a Petri net, is unfolded into a branching process using the event log. Subsequently, the resulting branching process is folded into a simpler process model capturing the desired behavior.
Keywords
Computer ScienceBusiness, Management and Accounting
Process Mining
1,749 Citations2011Wil M. P. van der Aalst
CERN Document Server (European Organization for Nuclear Research)Process Mining: Discovery, Conformance and Enhancement of Business Processes
1,736 Citations2011Wil M. P. van der Aalst
This book provides real-world techniques for monitoring and analyzing processes in real time and is a powerful new tool destined to play a key role in business process management.
Information SystemsConformance checking of processes based on monitoring real behavior
1,075 Citations2007A. Rozinat, Wil M. P. van der Aalst
An incremental approach to check the conformance of a process model and an event log is proposed and a Conformance Checker has been implemented within the ProM framework and it has been evaluated using artificial and real-life event logs.
Lecture notes in computer scienceFuzzy Mining – Adaptive Process Simplification Based on Multi-perspective Metrics
879 Citations2007Christian Günther, Wil M. P. van der Aalst
A new process mining approach is proposed that is configurable and allows for different faithfully simplifiedviews of a particular process, just like different roadmaps provide suitable abstractions of reality.
Lecture notes in computer scienceEvaluation Measures for Multi-class Subgroup Discovery
785 Citations2009Tarek Abudawood, Peter Flach
The usefulness of multi-class subgroup discovery is demonstrated experimentally, using discovered subgroups as features for a decision tree learner, and significant improvements in accuracy and AUC are achieved with particular evaluation measures and settings.
Data Mining and Knowledge DiscoveryGenetic process mining: an experimental evaluation
489 Citations2007Ana Karla Alves de Medeiros, A.J.M.M. Weijters +1 more
Experiments with synthetic and real-life logs show that the fitness measure indeed leads to the mining of process models that are complete (can reproduce all the behavior in the log) and precise (do not allow for extra behavior that cannot be derived from the event log).
Integrated Computer-Aided EngineeringRediscovering workflow models from event-based data using little thumb
462 Citations2003A.J.M.M. Weijters, Wil M. P. van der Aalst
The rediscovering technique proposed in this paper can deal with noise and can also be used to validate workflow processes by uncovering and measuring the discrepancies between prescriptive models and actual process executions.
Software & Systems ModelingProcess mining: a two-step approach to balance between underfitting and overfitting
438 Citations2008Wil M. P. van der Aalst, Vladimir Rubin +4 more
The two-step process mining approach, implemented in the context of ProM, overcomes many of the limitations of traditional approaches and enables the user to control the balance between “overfitting” and “underfitting’.
Lecture notes in computer scienceProcess Discovery Using Integer Linear Programming
337 Citations2008Jan Martijn E. M. van der Werf, Boudewijn F. van Dongen +2 more
Acta InformaticaBranching processes of Petri nets
320 Citations1991Joost Engelfriet
It is shown that the set of branching processes of a Petri net is a complete lattice, with respect to the natural notion of partial order.
Formal Methods in System DesignAn Improvement of McMillan's Unfolding Algorithm
304 Citations2002Javier Esparza, Stefan Römer +1 more
A refinement of McMillan's algorithm for verification of systems modelled with finite-state Petri nets overcomes the problem of initial parts that are larger than necessary (exponentially larger in the worst case).
Data & Knowledge EngineeringThe refined process structure tree
276 Citations2009Jussi Vanhatalo, Hagen Völzer +1 more
This paper provides a decomposition that is unique, modular and finer than in previous work, and gives two independent characterizations of the refined process structure tree which are equivalent and prove to be equivalent.
Fundamenta InformaticaeProcess Discovery using Integer Linear Programming
220 Citations2009J.M.E.M. van derWerf, Boudewijn F. van Dongen +2 more
This paper presents a process discovery algorithm where concepts taken from the language-based theory of regions, a well-known Petri net research area, are used and solutions based on integer linear programming are provided.
Lecture notes in computer scienceA Fresh Look at Precision in Process Conformance
181 Citations2010Jorge Muñoz-Gama, Josep Carmona
A novel measure for precision is proposed, based on the simple idea of counting these situations were the model deviates from the log, and a log-based traversal of the model that avoids inspecting its whole behavior is presented.
Lecture notes in computer scienceProcess Mining Based on Regions of Languages
177 Citations2007Robin Bergenthum, Jörg Desel +2 more
This paper considers Petri nets to represent process models, and adapts region based synthesis methods to the process mining domain, and compares them concerning efficiency and usefulness of the resulting Petri net.
Lecture notes in computer scienceProcess Mining: Overview and Outlook of Petri Net Discovery Algorithms
155 Citations2009Boudewijn F. van Dongen, Ana Karla Alves de Medeiros +1 more
An overview of different Petri net based discovery algorithms from both the area of process mining and the theory of regions is provided, which encompasses five categories of algorithms, for which common assumptions and problems are indicated.
Lecture notes in computer scienceMulti-phase Process Mining: Building Instance Graphs
150 Citations2004Boudewijn F. van Dongen, Wil M. P. van der Aalst
This paper presents an approach which constructs an instance graph for each individual process instance, based on information in the entire data set, in terms of Event-driven Process Chains (EPCs).
Lecture notes in computer scienceConceptual Modeling – ER 2004
138 Citations2004Dongen, van, B.F., Aalst, van der, W.M.P. +5 more
Lecture notes in business information processingTowards Robust Conformance Checking
129 Citations2011Arya Adriansyah, Boudewijn F. van Dongen +1 more
The growing complexity of processes in many organizations stimulates the adoption of business process management techniques, and the problem of checking to what extent the operational process conforms to the process model is increasingly important.
Lecture notes in computer scienceImproving the linearly based characterization of P/T nets
111 Citations1991José Manuel Colom, Manuel Silva
The state equation is a linear description of the reachable markings and firing count vectors of a P/T net that has the disadvantage that its solution space, in general, includes additional integer unreachable or/and unfirable vectors.
Lecture notes in computer scienceProcess Mining Meets Abstract Interpretation
40 Citations2010Josep Carmona, Jordi Cortadella
In this work, a theory for the derivation of a Petri net from a set of traces is presented, based on the theory of abstract interpretation, which has been applied successfully in other areas.
Synthesis of Admissible Behavior of Petri Nets for Partial Order Specifications
4 Citations2000Arndt Lüder, H.‐M. Hanisch
A formal method for constructing the admissible behavior of discrete event systems is presented, and this model constitutes a supervisor which would enforce the desired behavior on the plant.