Finding suitable activity clusters for decomposed process discovery

Event data can be found in any information system and provide the starting point for a range of process mining techniques. The widespread availability of large amounts of event data also creates new challenges. Existing process mining techniques are often unable to handle “big event data” adequately. Decomposed process mining aims to solve this problem by decomposing the process mining problem into many smaller problems which can be solved in less time, using less resources, or even in parallel. Many decomposed process mining techniques have been proposed in literature. Analysis shows that even though the decomposition step takes a relatively small amount of time, it is of key importance in finding a high-quality process model and for the computation time required to discover the individual parts. Currently there is no way to assess the quality of a decomposition beforehand. We define three quality notions that can be used to assess a decomposition, before using it to discover a model or check conformance with. We then propose a decomposition approach that uses these notions and is able to find a high-quality decomposition in little time.

[1]  Wil M. P. van der Aalst,et al.  Distributed Process Discovery and Conformance Checking , 2012, FASE.

[2]  Josep Carmona,et al.  A Region-Based Algorithm for Discovering Petri Nets from Event Logs , 2008, BPM.

[3]  Vojtech Huser,et al.  Process Mining: Discovery, Conformance and Enhancement of Business Processes , 2012, J. Biomed. Informatics.

[4]  Wil M. P. van der Aalst,et al.  A general divide and conquer approach for process mining , 2013, 2013 Federated Conference on Computer Science and Information Systems.

[5]  Wil M. P. van der Aalst,et al.  Hierarchical Conformance Checking of Process Models Based on Event Logs , 2013, Petri Nets.

[6]  Wil M. P. van der Aalst,et al.  Decomposing Petri nets for process mining: A generic approach , 2013, Distributed and Parallel Databases.

[7]  Wil M. P. van der Aalst,et al.  Decomposed Process Mining: The ILP Case , 2014, Business Process Management Workshops.

[8]  Wil M. P. van der Aalst,et al.  Distributed genetic process mining , 2010, IEEE Congress on Evolutionary Computation.

[9]  Bart Baesens,et al.  Robust Process Discovery with Artificial Negative Events , 2009, J. Mach. Learn. Res..

[10]  Josep Carmona,et al.  Divide-and-Conquer Strategies for Process Mining , 2009, BPM.

[11]  Serge Haddad,et al.  Application and Theory of Petri Nets , 2012, Lecture Notes in Computer Science.

[12]  Josep Carmona Projection approaches to process mining using region-based techniques , 2011, Data Mining and Knowledge Discovery.

[13]  Boualem Benatallah,et al.  Using Mapreduce to Scale Events Correlation Discovery for Business Processes Mining , 2012, BPM.

[14]  Itp Irene Vanderfeesten Product-based design and support of workflow processes , 2009 .

[15]  Wil M. P. van der Aalst,et al.  Conformance Checking in the Large: Partitioning and Topology , 2013, BPM.

[16]  Boudewijn F. van Dongen,et al.  Process Discovery using Integer Linear Programming , 2009, Fundam. Informaticae.

[17]  Wil M. P. van der Aalst,et al.  Decomposing Process Mining Problems Using Passages , 2012, Petri Nets.