Business process management employs process models and event logs to represent the behavior of the information systems under study. Traditional case-centric notions consider the order of activities and events in isolated process instances. The emerging field of object-centric processes challenges this assumption by putting objects in the center. Object-centric process mining and modeling approaches identify the structure of co-evolving data objects that influence the behavior of an information system to provide a comprehensive view of the system behavior. Object-centricity has been investigated independently in process modeling and in process mining, which resulted in the coexistence of seemingly contradictory assumptions and definitions. As a community effort, this research manifesto relates and aligns existing terminologies, definitions, and perspectives to provide a common ground for current and future research in object-centric business process management. Based on the current state of research, we propose a conceptualization that sets process models and event logs in relation to the information system’s behavior and the execution data it generates. The conceptualization aims at aligning different terminologies and, thus, providing a basis to model and analyze behavioral characteristics. Building on this common ground, we identify open research challenges along the most relevant research areas in object-centric process management. For each research area, its current status is investigated and an outline of the most relevant research challenges is presented.

To obtain insights from event data, advanced process mining methods assess the similarity of activities to incorporate their semantic relations into the analysis. Here, distributional similarity that captures similarity from activity co-occurrences is commonly employed. However, existing work for distributional similarity in process mining adopt neural network-based approaches as developed for natural language processing, e.g., word2vec and autoencoders. While these approaches have been shown to be effective, their downsides are high computational costs and limited interpretability of the learned representations. In this work, we argue for simplicity in the modeling of distributional similarity of activities. We introduce count-based embeddings that avoid a complex training process and offer a direct interpretable representation. To underpin our call for simple embeddings, we contribute a comprehensive benchmarking framework, which includes means to assess the intrinsic quality of embeddings, their performance in downstream applications, and their computational efficiency. In experiments that compare against the state of the art, we demonstrate that count-based embeddings provide a highly effective and efficient basis for distributional similarity between activities in event data.

Prescriptive process monitoring aims to derive recommendations for optimizing complex processes. While previous studies have successfully used reinforcement learning techniques to derive actionable policies in business processes, care processes present unique challenges due to their dynamic and multifaceted nature. For example, at any stage of a care process, a multitude of actions is possible. In this study, we follow the Reinforcement Learning (RL) approach and present a general approach that uses event data to build and train Markov decision processes. We proposed three algorithms including one that takes the elapsed time into account when transforming an event log into a semi-Markov decision process. We evaluated the RL approach using an aggression incident data set. Specifically, the goal is to optimize staff member actions when clients are displaying different types of aggressive behavior. The Q-learning and SARSA are used to find optimal policies. Our results showed that the derived policies align closely with current practices while offering alternative options in specific situations. By employing RL in the context of care processes, we contribute to the ongoing efforts to enhance decision-making and efficiency in dynamic and complex environments.

The field of process mining has evolved from discovering single work processes towards providing broad insights into peoples’ work practices. Existing techniques can be used to analyse such work practices, but this can be problematic if the available data is limited to the use of a single IT system or is not captured at the right level of granularity. We propose the use of a personal informatics technique, called Active Window Tracking (AWT), as a new way of gathering data for mining work practices. In this study, we identify the opportunities that this technique brings through a case study within our research group. In particular, we show how AWT helps to: capture previously-unrecorded work activities, expose the relations between work processes, and navigate between different levels of data granularity. The technique, which allows for generating new data as well as complementing existing data, is a valuable asset for the community when it comes to better understanding people’s work practices across individual systems and processes.

Predictive Process Monitoring aims to forecast the future progress of process instances using historical event data. As predictive process monitoring is increasingly applied in online settings to enable timely interventions, evaluating the performance of the underlying models becomes crucial for ensuring their consistency and reliability over time. This is especially important in high risk business scenarios where incorrect predictions may have severe consequences. However, predictive models are currently usually evaluated using a single, aggregated value or a time-series visualization, which makes it challenging to assess their performance and, specifically, their stability over time. This paper proposes an evaluation framework for assessing the stability of models for online predictive process monitoring. The framework introduces four performance meta-measures: the frequency of significant performance drops, the magnitude of such drops, the recovery rate, and the volatility of performance. To validate this framework, we applied it to two artificial and two real-world event logs. The results demonstrate that these meta-measures facilitate the comparison and selection of predictive models for different risk-taking scenarios. Such insights are of particular value to enhance decision-making in dynamic business environments.

Abstract The field of process mining focuses on distilling knowledge of the (historical) execution of a process based on the operational event data generated and stored during its execution. Most existing process mining techniques assume that the event data describe activity executions as degenerate time intervals, i.e., intervals of the form [ t , t ], yielding a strict total order on the observed activity instances. However, for various practical use cases, e.g., the logging of activity executions with a nonzero duration and uncertainty on the correctness of the recorded timestamps of the activity executions, assuming a partial order on the observed activity instances is more appropriate. Using partial orders to represent process executions, i.e., based on recorded event data, allows for new classes of process mining algorithms, i.e., aware of parallelism and robust to uncertainty. Yet, interestingly, only a limited number of studies consider using intermediate data abstractions that explicitly assume a partial order over a collection of observed activity instances. Considering recent developments in process mining, e.g., the prevalence of high-quality event data and techniques for event data abstraction, the need for algorithms designed to handle partially ordered event data is expected to grow in the upcoming years. Therefore, this paper presents a survey of process mining techniques that explicitly use partial orders to represent recorded process behavior. We performed a keyword search, followed by a snowball sampling strategy, yielding 68 relevant articles in the field. We observe a recent uptake in works covering partial-order-based process mining, e.g., due to the current trend of process mining based on uncertain event data. Furthermore, we outline promising novel research directions for the use of partial orders in the context of process mining algorithms.

An important part of healthcare decision making is to understand how certain actions relate to desired and undesired outcomes. One key challenge is to deal with confounding variables, i.e., variables that influence the relation between actions and outcomes. Existing techniques aim to uncover the underlying statistical relations between actions and outcomes, but either do not account for confounding variables or only consider the process or case level instead of the event level. Therefore, this paper proposes a novel relation mining approach for healthcare processes that 1) explicitly accounts for confounding variables at the event level, and 2) transparently communicates the effect of the confounding variables to the user. We demonstrate the applicability and importance of our approach using two evaluation experiments. We use a real-world healthcare dataset to show that the identified relations indeed provide important input for decision making in healthcare processes. We use a synthetic dataset to illustrate the importance of our approach in the general setting of causal model estimation.

Process mining techniques are valuable to gain insights into and help improve (work) processes. Many of these techniques focus on the sequential order in which activities are performed. Few of these techniques consider the statistical relations within processes. In particular, existing techniques do not allow insights into how responses to an event (action) result in desired or undesired outcomes (effects). We propose and formalize the ARE miner, a novel technique that allows us to analyze and understand these action-response-effect patterns. We take a statistical approach to uncover potential dependency relations in these patterns. The goal of this research is to generate processes that are: (1) appropriately represented, and (2) effectively filtered to show meaningful relations. We evaluate the ARE miner in two ways. First, we use an artificial data set to demonstrate the effectiveness of the ARE miner compared to two traditional process-oriented approaches. Second, we apply the ARE miner to a real-world data set from a Dutch healthcare institution. We show that the ARE miner generates comprehensible representations that lead to informative insights into statistical relations between actions, responses, and effects.

Before the findings of a process mining project can be turned into actionable insights or recommendations, it is essential to make sure that the findings are actually valid. Therefore, the evaluation of the findings is a crucial part of a successful process mining project. Current process mining methodologies, however, fall short in providing actionable support to perform such an evaluation. This is especially true when domain experts are involved. To close this gap, we performed a literature study considering all process mining case studies published in the last two decades. In total, we identified 244 candidate papers of which we analyzed 80 in depth. Based on this literature study, we found a need for a more systematic approach for qualitative evaluations in process mining projects where domain experts are involved. Therefore, we build on these results to propose six validation strategies, which originate from qualitative research. We believe that this proposal for more rigor in the evaluation phase of process mining projects helps to move the discipline forward.

In this work, we propose FlexHMiner (FH), a three-step approach for the discovery of hierarchal models. We formalize the concept of activity tree and event abstraction, which allows us to be flexible in the ways of computing the process hierarchy. We illustrate this flexibility by proposing three different techniques to discover an activity tree: (1) a fully domain based approach (DK-FH), (2) a random approach (RC-FH), and (3) a fall-back, flat activity tree (F-FH). After obtaining an activity tree, the second step of our approach is to compute the logs for each subprocess using log abstraction and log projection. Finally, FlexHMiner discovers a subprocess model for each subprocess by leveraging the capabilities of existing discovery algorithms. Using the domain-based approach as the gold standard and the flat tree approach as base line, we compare the three ways of discovering an activity tree using seven real-life logs.