Interpreting Process Predictions using a Milestone-Aware Counterfactual Approach

• URL: http://arxiv.org/abs/2107.08697v1
• Date: Mon, 19 Jul 2021 09:14:16 GMT
• Title: Interpreting Process Predictions using a Milestone-Aware Counterfactual Approach
• Authors: Chihcheng Hsieh and Catarina Moreira and Chun Ouyang
• Abstract summary: We explore the use of a popular model-agnostic counterfactual algorithm, DiCE, in the context of predictive process analytics. The analysis reveals that the algorithm is limited when being applied to derive explanations of process predictions. We propose an approach that supports deriving milestone-aware counterfactuals at different stages of a trace to promote interpretability.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Predictive process analytics often apply machine learning to predict the future states of a running business process. However, the internal mechanisms of many existing predictive algorithms are opaque and a human decision-maker is unable to understand \emph{why} a certain activity was predicted. Recently, counterfactuals have been proposed in the literature to derive human-understandable explanations from predictive models. Current counterfactual approaches consist of finding the minimum feature change that can make a certain prediction flip its outcome. Although many algorithms have been proposed, their application to the sequence and multi-dimensional data like event logs has not been explored in the literature. In this paper, we explore the use of a recent, popular model-agnostic counterfactual algorithm, DiCE, in the context of predictive process analytics. The analysis reveals that the algorithm is limited when being applied to derive explanations of process predictions, due to (1) process domain knowledge not being taken into account, (2) long traces that often tend to be less understandable, and (3) difficulties in optimising the counterfactual search with categorical variables. We design an extension of DiCE that can generate counterfactuals for process predictions, and propose an approach that supports deriving milestone-aware counterfactuals at different stages of a trace to promote interpretability. We apply our approach to BPIC2012 event log and the analysis results demonstrate the effectiveness of the proposed approach.

Related papers

• Achieving Fairness in Predictive Process Analytics via Adversarial Learning [50.31323204077591]
  This paper addresses the challenge of integrating a debiasing phase into predictive business process analytics. Our framework leverages on adversial debiasing is evaluated on four case studies, showing a significant reduction in the contribution of biased variables to the predicted value.
  arXiv  Detail & Related papers  (2024-10-03T15:56:03Z)
• Generating Feasible and Plausible Counterfactual Explanations for Outcome Prediction of Business Processes [45.502284864662585]
  We introduce a data-driven approach, REVISEDplus, to generate plausible counterfactual explanations. First, we restrict the counterfactual algorithm to generate counterfactuals that lie within a high-density region of the process data. We also ensure plausibility by learning sequential patterns between the activities in the process cases.
  arXiv  Detail & Related papers  (2024-03-14T09:56:35Z)
• Scalable computation of prediction intervals for neural networks via matrix sketching [79.44177623781043]
  Existing algorithms for uncertainty estimation require modifying the model architecture and training procedure. This work proposes a new algorithm that can be applied to a given trained neural network and produces approximate prediction intervals.
  arXiv  Detail & Related papers  (2022-05-06T13:18:31Z)
• Non-Clairvoyant Scheduling with Predictions Revisited [77.86290991564829]
  In non-clairvoyant scheduling, the task is to find an online strategy for scheduling jobs with a priori unknown processing requirements. We revisit this well-studied problem in a recently popular learning-augmented setting that integrates (untrusted) predictions in algorithm design. We show that these predictions have desired properties, admit a natural error measure as well as algorithms with strong performance guarantees.
  arXiv  Detail & Related papers  (2022-02-21T13:18:11Z)
• Learning Predictions for Algorithms with Predictions [49.341241064279714]
  We introduce a general design approach for algorithms that learn predictors. We apply techniques from online learning to learn against adversarial instances, tune robustness-consistency trade-offs, and obtain new statistical guarantees. We demonstrate the effectiveness of our approach at deriving learning algorithms by analyzing methods for bipartite matching, page migration, ski-rental, and job scheduling.
  arXiv  Detail & Related papers  (2022-02-18T17:25:43Z)
• A systematic literature review on state-of-the-art deep learning methods for process prediction [0.0]
  In recent years, multiple process prediction approaches have been proposed, applying different data processing schemes and prediction algorithms. This study focuses on deep learning algorithms since they seem to outperform their machine learning alternatives consistently. The set of log-data, evaluation metrics and baselines used by the authors diverge, making the results hard to compare.
  arXiv  Detail & Related papers  (2021-01-22T20:26:40Z)
• Evaluating Explainable Methods for Predictive Process Analytics: A Functionally-Grounded Approach [2.2448567386846916]
  Predictive process analytics focuses on predicting the future states of running instances of a business process. Current explainable machine learning methods, such as LIME and SHAP, can be used to interpret black box models. We apply the proposed metrics to evaluate the performance of LIME and SHAP in interpreting process predictive models built on XGBoost.
  arXiv  Detail & Related papers  (2020-12-08T05:05:19Z)
• XNAP: Making LSTM-based Next Activity Predictions Explainable by Using LRP [0.415623340386296]
  Predictive business process monitoring (PBPM) is a class of techniques designed to predict behaviour, such as next activities, in running traces. With the use of deep neural networks (DNNs), the techniques predictive quality could be improved for tasks like the next activity prediction. In this paper, we propose XNAP, the first explainable, DNN-based PBPM technique for the next activity prediction.
  arXiv  Detail & Related papers  (2020-08-18T15:40:07Z)
• Counterfactual Predictions under Runtime Confounding [74.90756694584839]
  We study the counterfactual prediction task in the setting where all relevant factors are captured in the historical data. We propose a doubly-robust procedure for learning counterfactual prediction models in this setting.
  arXiv  Detail & Related papers  (2020-06-30T15:49:05Z)

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.