Mining process models with non-free-choice constructs

Abstract

Process mining aims at extracting information from event logs to capture the business process as it is being executed. Process mining is particularly useful in situations where events are recorded but there is no system enforcing people to work in a particular way. Consider for example a hospital where the diagnosis and treatment activities are recorded in the hospital information system, but where health-care professionals determine the "careflow." Many process mining approaches have been proposed in recent years. However, in spite of many researchers' persistent efforts, there are still several challenging problems to be solved. In this paper, we focus on mining non-freechoice constructs, i.e., situations where there is a mixture of choice and synchronization. Although most real-life processes exhibit non-free-choice behavior, existing algorithms are unable to adequately deal with such constructs. Using a Petri-net-based representation, we will show that there are two kinds of causal dependencies between tasks, i.e., explicit and implicit ones. We propose an algorithm that is able to deal with both kinds of dependencies. The algorithm has

Process mining: a two-step approach to balance between underfitting and overfitting

“…Moreover, there are no connections from the choice between D and E to the choice between K and L. Some of the algorithms presented in literature can overcome these problems. For example, the α ++ algorithm presented in [41] and implemented in ProM can discover the non-local dependencies between D (E) and K (L). However, it cannot handle the skipping of F leading to the same problem as shown in Fig.…”

Log-based mining techniques applied to Web service composition reengineering

“…Moreover, even if non-free choice (NFC) construct is mentioned as an example of a pattern that is difficult to mine, WorkflowMiner discovers M-out-of-N-Join pattern which can be seen as a generalisation of the useful Discriminator pattern that were proven to be inherently non free-choice. Recently, [36,29] propose a complete solution that can deal with such constructs. Besides, our mining approach discovers more complex features with a better specification of "fork" operator (and-split, or-split, xor-split patterns) and "join" operator (and-join, M-out-of-N-Join, and M-out-of-N-Join patterns).…”

Discovery of Frequent Episodes in Event Logs

“…The HeuristicsMiner is based on the notion of causal nets (C-nets). Several variants of the α algorithm have been proposed [12,13]. Moreover, completely different approaches have been proposed, e.g., the different types of genetic process mining [14,15], techniques based on state-based regions [16,17], and techniques based on language-based regions [18,19].…”