Christoffer Olling Back

University of Copenhagen · Department of Computer Science

Event knowledge graphs (EKG) extend the classical notion of a trace to capture multiple, interacting views of a process execution. In this paper, we tackle the open problem of automating EKG discovery from uncurated data through a principled, probabilistic framing based on the outcome space resulting from featured-derived partial orders on events....

Trace similarity is a prerequisite for several process mining tasks, e.g. identifying process variants and anomalies. Many similarity metrics have been presented in the literature, but the similarity metric itself is seldom subject to controlled evaluation. Instead, they are usually demonstrated in conjunction with downstream tasks, e.g. process mo...

Declarative process modeling formalisms—which capture high-level process constraints—have seen growing interest, especially for modeling flexible processes. This paper presents DisCoveR, an efficient and accurate declarative miner for learning Dynamic Condition Response (DCR) Graphs from event logs. We present a precise formalization of the algorit...

Contemporary process discovery methods take as inputs only positive examples of process executions, and so they are one-class classification algorithms. However, we have found negative examples to also be available in industry, hence we propose to treat process discovery as a binary classification problem. This approach opens the door to many well-...

Intelligent systems play an increasingly central role in healthcare systems worldwide. Nonetheless, operational friction represents an obstacle to full utilization of scarce resources and improvement of service standards. In this paper we address the challenge of developing data-driven models of complex workflow systems - a prerequisite for harness...

Declarative process modeling formalisms - which capture high-level process constraints - have seen growing interest, especially for modeling flexible processes. This paper presents DisCoveR, an extremely efficient and accurate declarative miner for learning Dynamic Condition Response (DCR) Graphs from event logs. We precisely formalize the algorith...

Process mining algorithms fall in two classes: imperative miners output flow diagrams, showing all possible paths, whereas declarative miners output constraints, showing the rules governing a process. But given a log, how do we know which of the two to apply? Assuming that logs exhibiting a large degree of variability are more suited for declarativ...

Declarative process discovery is the art of using historical data to better understand the responsibilities of an organisation: its governing business rules and goals. These rules and goals can be described using declarative process notations, such as Dynamic Condition Response (DCR) Graphs, which has seen widespread industrial adoption within Denm...

Process modelling notations fall in two broad categories: declarative notations, which specify the rules governing a process; and imperative notations, which specify the flows admitted by a process. We outline an empirical approach to addressing the question of whether certain process logs are better suited for mining to imperative than declarative...