Explainable Predictive Decision Mining for Operational Support

• URL: http://arxiv.org/abs/2210.16786v1
• Date: Sun, 30 Oct 2022 09:27:41 GMT
• Title: Explainable Predictive Decision Mining for Operational Support
• Authors: Gyunam Park, Aaron K\"usters, Mara Tews, Cameron Pitsch, Jonathan Schneider, and Wil M. P. van der Aalst
• Abstract summary: Decision mining aims to describe/predict the routing of a process instance at a decision point of the process. Existing techniques for decision mining have focused largely on describing decisions but not on predicting them. Our proposed approach provides explanations of the predicted decisions using SHAP values to support the elicitation of proactive actions.
• Score: 0.3232625980782302
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Several decision points exist in business processes (e.g., whether a purchase order needs a manager's approval or not), and different decisions are made for different process instances based on their characteristics (e.g., a purchase order higher than $500 needs a manager approval). Decision mining in process mining aims to describe/predict the routing of a process instance at a decision point of the process. By predicting the decision, one can take proactive actions to improve the process. For instance, when a bottleneck is developing in one of the possible decisions, one can predict the decision and bypass the bottleneck. However, despite its huge potential for such operational support, existing techniques for decision mining have focused largely on describing decisions but not on predicting them, deploying decision trees to produce logical expressions to explain the decision. In this work, we aim to enhance the predictive capability of decision mining to enable proactive operational support by deploying more advanced machine learning algorithms. Our proposed approach provides explanations of the predicted decisions using SHAP values to support the elicitation of proactive actions. We have implemented a Web application to support the proposed approach and evaluated the approach using the implementation.

Related papers

• Extracting Process-Aware Decision Models from Object-Centric Process Data [54.04724730771216]
  This paper proposes the first object-centric decision-mining algorithm called Integrated Object-centric Decision Discovery Algorithm (IODDA) IODDA is able to discover how a decision is structured as well as how a decision is made.
  arXiv  Detail & Related papers  (2024-01-26T13:27:35Z)
• Optimized Task Assignment and Predictive Maintenance for Industrial Machines using Markov Decision Process [0.0]
  This paper considers a distributed decision-making approach for manufacturing task assignment and condition-based machine health maintenance. We propose the design of the decision-making agents based on Markov decision processes.
  arXiv  Detail & Related papers  (2024-01-20T12:12:14Z)
• Rational Decision-Making Agent with Internalized Utility Judgment [91.80700126895927]
  Large language models (LLMs) have demonstrated remarkable advancements and have attracted significant efforts to develop LLMs into agents capable of executing intricate multi-step decision-making tasks beyond traditional NLP applications. This paper proposes RadAgent, which fosters the development of its rationality through an iterative framework involving Experience Exploration and Utility Learning. Experimental results on the ToolBench dataset demonstrate RadAgent's superiority over baselines, achieving over 10% improvement in Pass Rate on diverse tasks.
  arXiv  Detail & Related papers  (2023-08-24T03:11:45Z)
• An End-to-End Approach for Online Decision Mining and Decision Drift Analysis in Process-Aware Information Systems: Extended Version [0.0]
  Decision mining enables the discovery of decision rules from event logs or streams. Online decision mining enables continuous monitoring of decision rule evolution and decision drift. This paper presents an end-to-end approach for the discovery as well as monitoring of decision points and the corresponding decision rules during runtime.
  arXiv  Detail & Related papers  (2023-03-07T15:04:49Z)
• Explainable Data-Driven Optimization: From Context to Decision and Back Again [76.84947521482631]
  Data-driven optimization uses contextual information and machine learning algorithms to find solutions to decision problems with uncertain parameters. We introduce a counterfactual explanation methodology tailored to explain solutions to data-driven problems. We demonstrate our approach by explaining key problems in operations management such as inventory management and routing.
  arXiv  Detail & Related papers  (2023-01-24T15:25:16Z)
• Explainability's Gain is Optimality's Loss? -- How Explanations Bias Decision-making [0.0]
  Explanations help to facilitate communication between the algorithm and the human decision-maker. Feature-based explanations' semantics of causal models induce leakage from the decision-maker's prior beliefs. Such differences can lead to sub-optimal and biased decision outcomes.
  arXiv  Detail & Related papers  (2022-06-17T11:43:42Z)
• Inverse Online Learning: Understanding Non-Stationary and Reactionary Policies [79.60322329952453]
  We show how to develop interpretable representations of how agents make decisions. By understanding the decision-making processes underlying a set of observed trajectories, we cast the policy inference problem as the inverse to this online learning problem. We introduce a practical algorithm for retrospectively estimating such perceived effects, alongside the process through which agents update them. Through application to the analysis of UNOS organ donation acceptance decisions, we demonstrate that our approach can bring valuable insights into the factors that govern decision processes and how they change over time.
  arXiv  Detail & Related papers  (2022-03-14T17:40:42Z)
• Counterfactual Explanations in Sequential Decision Making Under Uncertainty [27.763369810430653]
  We develop methods to find counterfactual explanations for sequential decision making processes. In our problem formulation, the counterfactual explanation specifies an alternative sequence of actions differing in at most k actions. We show that our algorithm finds can provide valuable insights to enhance decision making under uncertainty.
  arXiv  Detail & Related papers  (2021-07-06T17:38:19Z)
• Efficient PAC Reinforcement Learning in Regular Decision Processes [99.02383154255833]
  We study reinforcement learning in regular decision processes. Our main contribution is to show that a near-optimal policy can be PAC-learned in time in a set of parameters.
  arXiv  Detail & Related papers  (2021-05-14T12:08:46Z)
• Inverse Active Sensing: Modeling and Understanding Timely Decision-Making [111.07204912245841]
  We develop a framework for the general setting of evidence-based decision-making under endogenous, context-dependent time pressure. We demonstrate how it enables modeling intuitive notions of surprise, suspense, and optimality in decision strategies.
  arXiv  Detail & Related papers  (2020-06-25T02:30:45Z)

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.