Ajmm Ton Weijters

The prom framework: a new era in process mining tool support

Under the umbrella of buzzwords such as “Business Activity Monitoring” (BAM) and “Business Process Intelligence” (BPI) both academic (e.g., EMiT, Little Thumb, InWoLvE, Process Miner, and MinSoN) and commercial tools (e.g., ARIS PPM, HP BPI, and ILOG JViews) have been developed. The goal of these tools is to extract knowledge from event logs (e.g., transaction logs in an ERP system or audit trails in a WFM system), i.e., to do process mining. Unfortunately, tools use different formats for reading/storing log files and present their results in different ways. This makes it difficult to use different tools on the same data set and to compare the mining results. Furthermore, some of these tools implement concepts that can be very useful in the other tools but it is often difficult to combine tools. As a result, researchers working on new process mining techniques are forced to build a mining infrastructure from scratch or test their techniques in an isolated way, disconnected from any practical applications. To overcome these kind of problems, we have developed the ProM framework, i.e., an “pluggable” environment for process mining. The framework is flexible with respect to the input and output format, and is also open enough to allow for the easy reuse of code during the implementation of new process mining ideas. This paper introduces the ProM framework and gives an overview of the plug-ins that have been developed.

Process mining: a research agenda

Enterprise information systems support and control operational business processes ranging from simple internal back-office process to complex interorganizational processes. Technologies such as workflow management (WFM), enterprise, application integration (EAI), enterprise resource planning (ERP), and web services (WS) typically focus on the realization of IT support rather than monitoring the operational business processes. Process mining aims at extracting information from event logs to capture the business process as it is being executed. In this paper, we put the topic of process mining into context, discuss the main issues around process mining, and finally we introduce the papers in this special issue.

Flexible Heuristics Miner (FHM)

One of the aims of process mining is to retrieve a process model from a given event log. However, current techniques have problems when mining processes that contain nontrivial constructs, processes that are low structured and/or dealing with the presence of noise in the event logs. To overcome these problems, a new process representation language is presented in combination with an accompanying process mining algorithm. The most significant property of the new representation language is in the way the semantics of splits and joins are represented; by using so-called split/join frequency tables. This results in easy to understand process models even in the case of non-trivial constructs, low structured domains and the presence of noise. This paper explains the new process representation language and how the mining algorithm works. The algorithm is implemented as a plug-in in the ProM framework. An illustrative example with noise and a real life log of a complex and low structured process are used to explicate the presented approach.

Workflow mining. Current status and future directions

Current workflow management systems require the explicit design of the workflows that express the business process of an organization. This process design is very time consuming and error prone. Considerable work has been done to develop heuristics to mine event-data logs to produce a process model that can support the workflow design process. However, all the existing heuristic-based mining algorithms have their limitations. To achieve more insight into these limitations the starting point in this paper is the α-algorithm [3] for which it is proved under which conditions and process constructs the algorithm works. After presentation of the α-algorithm, a classification is given of the process constructs that are difficult to handle for this type of algorithms. Then, for some constructs (i.e. short loops) it is illustrated in which way the α-algorithm can be extended so that it can correctly discover these constructs.

The need for a process mining evaluation framework in research and practice

Although there has been much progress in developing process mining algorithms in recent years, no effort has been put in developing a common means of assessing the quality of the models discovered by these algorithms. In this paper, we motivate the need for such an evaluation mechanism, and outline elements of an evaluation framework that is intended to enable (a) process mining researchers to compare the performance of their algorithms, and (b) end users to evaluate the validity of their process mining results.

Process mining for ubiquitous mobile systems: an overview and a concrete algorithm

Ubiquitous Mobile Systems (UMSs) allow for automated capturing of events. Both mobility and ubiquity are supported by electronic means such as mobile phones and PDAs and technologies such as RFID, Bluetooth, WLAN, etc. These can be used to automatically record human behavior and business processes in detail. UMSs typically also allow for more flexibility. The combination of flexibility (i.e., the ability to deviate from standard procedures) and the automated capturing of events, provides an interesting application domain for process mining. The goal of process mining is to discover process models from event logs. The α-algorithm is a process mining algorithm whose application is not limited to ubiquitous and/or mobile systems. Unfortunately, the α-algorithm is unable to tackle so-called “short loops”, i.e., the repeated occurrence of the same event. Therefore, a new algorithm is proposed to deal with short loops: the α+-algorithm. This algorithm has been implemented in the EMiT tool.

Makespan estimation in batch process industries: A comparison between regression analysis and neural networks

Abstract Batch processing is becoming more important in the process industries, because of the increasing product variety and the decreasing demand volumes for individual products. In batch process industries it is difficult to estimate the completion time, or makespan, of a set of jobs, because jobs interact at the shop floor. We assume a situation with hierarchical production control consisting of a planning level and a scheduling level. In this paper we focus on the planning level. We use two different techniques for estimating the makespan of job sets in batch process industries. The first technique estimates the makespan of a job set by developing regression models, the second technique by training neural networks. Both techniques use aggregate information. By using aggregate information the presented techniques are less time consuming in assessing the makespan of a job set compared with methods based on detailed information. Tests on newly generated job sets showed that both techniques are robust for changes in the number of jobs, the average processing time, a more unbalanced workload and for different resource configurations. Finally, the estimation quality of the neural network models appears significantly better than the quality of regression models.

Event cube: another perspective on business processes

In this paper the so-called Event Cube is introduced, a multidimensional data structure that can hold information about all business dimensions. Like the data cubes of online analytic processing (OLAP) systems, the Event Cube can be used to improve the business analysis quality by providing immediate results under different levels of abstraction. An exploratory analysis of the application of process mining on multidimensional process data is the focus of this paper. The feasibility and potential of this approach is demonstrated through some practical examples.

Process Mining: Discovering Direct Successors in Process Logs

Workflow management technology requires the existence of explicit process models, i.e. a completely specified workflow design needs to be developed in order to enact a given workflow process. Such a workflow design is time consuming and often subjective and incomplete. We propose a learning method that uses the workflow log, which contains information about the process as it is actually being executed. In our method we will use a logistic regression model to discover the direct connections between events of a realistic not complete workflow log with noise. Experimental results are used to show the usefulness and limitations of the presented method.

Discovering distributed processes in supply chains

Processes such as tendering, ordering, delivery, and paying are executed by several parties in almost all supply chains. However, none of these parties has a proper overview over the whole set of activities executed. Therefore, none of the parties can take the lead in business process redesign. Business processes are often not described in an explicit manner, and therefore they are not available for analysis. However, in the information system of each supply chain party, partial information about the business process are recorded. We claim that the overall distributed process can be induced, by using this partial information of all involved parties.