Mining process models with non-free-choice constructs

  • Authors:

  • Lijie Wen;Wil M. Aalst;Jianmin Wang;Jiaguang Sun

  • Affiliations:

  • School of Software, Tsinghua University, Beijing, China 100084;Eindhoven Univerisity of Technology, Eindhoven, The Netherlands 5600 MB;School of Software, Tsinghua University, Beijing, China 100084;School of Software, Tsinghua University, Beijing, China 100084

  • Venue:
  • Data Mining and Knowledge Discovery
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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-free-choice 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 been implemented in the ProM framework and experimental results shows that the algorithm indeed significantly improves existing process mining techniques.