Case Level Counterfactual Reasoning in Process Mining

• URL: http://arxiv.org/abs/2102.13490v1
• Date: Thu, 25 Feb 2021 09:52:18 GMT
• Title: Case Level Counterfactual Reasoning in Process Mining
• Authors: Mahnaz Sadat Qafari, Wil van der Aalst
• Abstract summary: We advocate the use of emphstructural equation models and emphcounterfactual reasoning Our ProM plug-in produces recommendations that indicate how specific cases could have been handled differently to avoid a performance or compliance problem.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Process mining is widely used to diagnose processes and uncover performance and compliance problems. It is also possible to see relations between different behavioral aspects, e.g., cases that deviate more at the beginning of the process tend to get delayed in the last part of the process. However, correlations do not necessarily reveal causalities. Moreover, standard process mining diagnostics do not indicate how to improve the process. This is the reason we advocate the use of \emph{structural equation models} and \emph{counterfactual reasoning}. We use results from causal inference and adapt these to be able to reason over event logs and process interventions. We have implemented the approach as a ProM plug-in and have evaluated it on several data sets. Our ProM plug-in produces recommendations that indicate how specific cases could have been handled differently to avoid a performance or compliance problem.

Related papers

• On the Identification of Temporally Causal Representation with Instantaneous Dependence [50.14432597910128]
  Temporally causal representation learning aims to identify the latent causal process from time series observations. Most methods require the assumption that the latent causal processes do not have instantaneous relations. We propose an textbfIDentification framework for instantanetextbfOus textbfLatent dynamics.
  arXiv  Detail & Related papers  (2024-05-24T08:08:05Z)
• Detecting Anomalous Events in Object-centric Business Processes via Graph Neural Networks [55.583478485027]
  This study proposes a novel framework for anomaly detection in business processes. We first reconstruct the process dependencies of the object-centric event logs as attributed graphs. We then employ a graph convolutional autoencoder architecture to detect anomalous events.
  arXiv  Detail & Related papers  (2024-02-14T14:17:56Z)
• Posterior Contraction Rates for Mat\'ern Gaussian Processes on Riemannian Manifolds [51.68005047958965]
  We show that intrinsic Gaussian processes can achieve better performance in practice. Our work shows that finer-grained analyses are needed to distinguish between different levels of data-efficiency.
  arXiv  Detail & Related papers  (2023-09-19T20:30:58Z)
• The Interplay Between High-Level Problems and The Process Instances That Give Rise To Them [0.13124513975412253]
  We use the term high-level behavior to cover all process behavior which can not be captured in terms of the individual process instances. We first show how to detect and correlate observations of high-level problems, as well as determine the corresponding (non-)participating cases.
  arXiv  Detail & Related papers  (2023-09-04T12:46:46Z)
• Trace Encoding in Process Mining: a survey and benchmarking [0.34410212782758054]
  Methods are employed across several process mining tasks, including predictive process monitoring, anomalous case detection, clustering trace, etc. Most papers choose existing encoding methods arbitrarily or employ a strategy based on a specific expert knowledge domain. This work aims at providing a comprehensive survey on event log encoding by comparing 27 methods.
  arXiv  Detail & Related papers  (2023-01-05T17:25:30Z)
• Detecting Surprising Situations in Event Data [0.45119235878273]
  In existing work, it is usually assumed that the set of problematic process instances in which an undesirable outcome occurs is known prior or is easily detectable. We formulate finding the process enhancement areas as a context-sensitive anomaly/outlier detection problem. We aim to characterize those situations where process performance/outcome is significantly different from what was expected.
  arXiv  Detail & Related papers  (2022-08-29T11:33:58Z)
• Conformance Checking with Uncertainty via SMT (Extended Version) [66.58864135810981]
  We show how to solve the problem of checking conformance of uncertain logs against data-aware reference processes. Our approach is modular, in that it homogeneously accommodates for different types of uncertainty. We show the correctness of our approach and witness feasibility through a proof-of-concept implementation.
  arXiv  Detail & Related papers  (2022-06-15T11:39:45Z)
• Reinforcement Learning with a Terminator [80.34572413850186]
  We learn the parameters of the TerMDP and leverage the structure of the estimation problem to provide state-wise confidence bounds. We use these to construct a provably-efficient algorithm, which accounts for termination, and bound its regret.
  arXiv  Detail & Related papers  (2022-05-30T18:40:28Z)
• CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT (Extended Version) [62.96267257163426]
  We introduce the CoCoMoT (Computing Conformance Modulo Theories) framework. First, we show how SAT-based encodings studied in the pure control-flow setting can be lifted to our data-aware case. Second, we introduce a novel preprocessing technique based on a notion of property-preserving clustering.
  arXiv  Detail & Related papers  (2021-03-18T20:22:50Z)
• Process Mining Meets Causal Machine Learning: Discovering Causal Rules from Event Logs [0.8924669503280334]
  We use an action rule mining technique to identify treatments that co-occur with the outcome under some conditions. We then use a causal machine learning technique, specifically uplift trees, to discover subgroups of cases for which a treatment has a high causal effect on the outcome.
  arXiv  Detail & Related papers  (2020-09-03T10:10:30Z)
• Partial Order Resolution of Event Logs for Process Conformance Checking [10.58705988536919]
  A key assumption of existing conformance checking techniques is that all events are associated with timestamps that allow to infer a total order of events per process instance. We present several estimators for this task, incorporating different notions of behavioral abstraction. Our experiments with real-world and synthetic data reveal that our approach improves accuracy over the state-of-the-art considerably.
  arXiv  Detail & Related papers  (2020-07-05T18:43:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.