Comparing decision mining approaches with regard to the meaningfulness of their results

• URL: http://arxiv.org/abs/2109.07335v1
• Date: Wed, 15 Sep 2021 14:43:36 GMT
• Title: Comparing decision mining approaches with regard to the meaningfulness of their results
• Authors: Beate Scheibel, Stefanie Rinderle-Ma
• Abstract summary: This paper compares three decision mining approaches, i.e., two existing ones and one newly described approach, with respect to the meaningfulness of their results. The discovered decision rules are discussed with regards to their semantics and meaningfulness.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Decisions and the underlying rules are indispensable for driving process execution during runtime, i.e., for routing process instances at alternative branches based on the values of process data. Decision rules can comprise unary data conditions, e.g., age > 40, binary data conditions where the relation between two or more variables is relevant, e.g. temperature1 < temperature2, and more complex conditions that refer to, for example, parts of a medical image. Decision discovery aims at automatically deriving decision rules from process event logs. Existing approaches focus on the discovery of unary, or in some instances binary data conditions. The discovered decision rules are usually evaluated using accuracy, but not with regards to their semantics and meaningfulness, although this is crucial for validation and the subsequent implementation/adaptation of the decision rules. Hence, this paper compares three decision mining approaches, i.e., two existing ones and one newly described approach, with respect to the meaningfulness of their results. For comparison, we use one synthetic data set for a realistic manufacturing case and the two real-world BPIC 2017/2020 logs. The discovered rules are discussed with regards to their semantics and meaningfulness.

Related papers

• Bidirectional Decoding: Improving Action Chunking via Closed-Loop Resampling [51.38330727868982]
  Bidirectional Decoding (BID) is a test-time inference algorithm that bridges action chunking with closed-loop operations. We show that BID boosts the performance of two state-of-the-art generative policies across seven simulation benchmarks and two real-world tasks.
  arXiv  Detail & Related papers  (2024-08-30T15:39:34Z)
• 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)
• Data is Moody: Discovering Data Modification Rules from Process Event Logs [31.187669045960085]
  We propose an algorithm to find accurate yet succinct and interpretable if-then rules how the process modifies data. We show Moody indeed finds compact and interpretable rules, needs little data for accurate discovery, and is robust to noise.
  arXiv  Detail & Related papers  (2023-12-22T10:00:50Z)
• Counterfactual Prediction Under Selective Confounding [3.6860485638625673]
  This research addresses the challenge of conducting causal inference between a binary treatment and its resulting outcome when not all confounders are known. We relax the requirement of knowing all confounders under desired treatment, which we refer to as Selective Confounding. We provide both theoretical error bounds and empirical evidence of the effectiveness of our proposed scheme using synthetic and real-world child placement data.
  arXiv  Detail & Related papers  (2023-10-21T16:54:59Z)
• Relational Proxies: Emergent Relationships as Fine-Grained Discriminators [52.17542855760418]
  We propose a novel approach that leverages information between the global and local part of an object for encoding its label. We design Proxies based on our theoretical findings and evaluate it on seven challenging fine-grained benchmark datasets. We also experimentally validate our theory and obtain consistent results across multiple benchmarks.
  arXiv  Detail & Related papers  (2022-10-05T11:08:04Z)
• An Experimental Design Perspective on Model-Based Reinforcement Learning [73.37942845983417]
  In practical applications of RL, it is expensive to observe state transitions from the environment. We propose an acquisition function that quantifies how much information a state-action pair would provide about the optimal solution to a Markov decision process.
  arXiv  Detail & Related papers  (2021-12-09T23:13:57Z)
• Exploring Business Process Deviance with Sequential and Declarative Patterns [3.039637436705478]
  Deviance mining is concerned with uncovering the reasons for deviant executions by analyzing event logs stored by the systems supporting the execution of a business process. The problem of explaining deviations in business processes is first investigated by using features based on sequential and declarative patterns. The explanations are then extracted by direct and indirect methods for rule induction.
  arXiv  Detail & Related papers  (2021-11-24T12:16:07Z)
• Information efficient learning of complexly structured preferences: Elicitation procedures and their application to decision making under uncertainty [0.0]
  We propose efficient methods for elicitation of complexly structured preferences. We show that under certain conditions optimal decisions can be found without fully specifying the preference system.
  arXiv  Detail & Related papers  (2021-10-19T07:01:24Z)
• A2Log: Attentive Augmented Log Anomaly Detection [53.06341151551106]
  Anomaly detection becomes increasingly important for the dependability and serviceability of IT services. Existing unsupervised methods need anomaly examples to obtain a suitable decision boundary. We develop A2Log, which is an unsupervised anomaly detection method consisting of two steps: Anomaly scoring and anomaly decision.
  arXiv  Detail & Related papers  (2021-09-20T13:40:21Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)

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.