Exploring Business Process Deviance with Sequential and Declarative Patterns

• URL: http://arxiv.org/abs/2111.12454v1
• Date: Wed, 24 Nov 2021 12:16:07 GMT
• Title: Exploring Business Process Deviance with Sequential and Declarative Patterns
• Authors: Giacomo Bergami, Chiara Di Francescomarino, Chiara Ghidini, Fabrizio Maria Maggi, Joonas Puura
• Abstract summary: 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.
• Score: 3.039637436705478
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Business process deviance refers to the phenomenon whereby a subset of the executions of a business process deviate, in a negative or positive way, with respect to {their} expected or desirable outcomes. Deviant executions of a business process include those that violate compliance rules, or executions that undershoot or exceed performance targets. 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. In this paper, the problem of explaining deviations in business processes is first investigated by using features based on sequential and declarative patterns, and a combination of them. Then, the explanations are further improved by leveraging the data attributes of events and traces in event logs through features based on pure data attribute values and data-aware declarative rules. The explanations characterizing the deviances are then extracted by direct and indirect methods for rule induction. Using real-life logs from multiple domains, a range of feature types and different forms of decision rules are evaluated in terms of their ability to accurately discriminate between non-deviant and deviant executions of a process as well as in terms of understandability of the final outcome returned to the users.

Related papers

• 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)
• 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)
• Code Models are Zero-shot Precondition Reasoners [83.8561159080672]
  We use code representations to reason about action preconditions for sequential decision making tasks. We propose a precondition-aware action sampling strategy that ensures actions predicted by a policy are consistent with preconditions.
  arXiv  Detail & Related papers  (2023-11-16T06:19:27Z)
• Inverse Decision Modeling: Learning Interpretable Representations of Behavior [72.80902932543474]
  We develop an expressive, unifying perspective on inverse decision modeling. We use this to formalize the inverse problem (as a descriptive model) We illustrate how this structure enables learning (interpretable) representations of (bounded) rationality.
  arXiv  Detail & Related papers  (2023-10-28T05:05:01Z)
• Outcome-Oriented Prescriptive Process Monitoring Based on Temporal Logic Patterns [9.876717580544364]
  We propose a new Outcome-Oriented Prescriptive Process Monitoring system. It recommends temporal relations between activities that have to be guaranteed during the process execution. This softens the mandatory execution of an activity at a given point in time, thus leaving more freedom to the user.
  arXiv  Detail & Related papers  (2022-11-09T13:36:07Z)
• Accessing and Interpreting OPC UA Event Traces based on Semantic Process Descriptions [69.9674326582747]
  This paper proposes an approach to access a production systems' event data based on the event data's context. The approach extracts filtered event logs from a database system by combining: 1) a semantic model of a production system's hierarchical structure, 2) a formalized process description and 3) an OPC UA information model.
  arXiv  Detail & Related papers  (2022-07-25T15:13:44Z)
• Explainability in Process Outcome Prediction: Guidelines to Obtain Interpretable and Faithful Models [77.34726150561087]
  We define explainability through the interpretability of the explanations and the faithfulness of the explainability model in the field of process outcome prediction. This paper contributes a set of guidelines named X-MOP which allows selecting the appropriate model based on the event log specifications.
  arXiv  Detail & Related papers  (2022-03-30T05:59:50Z)
• Process discovery on deviant traces and other stranger things [6.974048370610024]
  We focus on declarative processes and embrace the less-popular view of process discovery as a binary supervised learning task. We deepen how the valuable information brought by both these two sets can be extracted and formalised into a model that is "optimal" according to user-defined goals.
  arXiv  Detail & Related papers  (2021-09-30T06:58:34Z)
• Comparing decision mining approaches with regard to the meaningfulness of their results [0.0]
  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.
  arXiv  Detail & Related papers  (2021-09-15T14:43:36Z)
• Knowledge-Aware Procedural Text Understanding with Multi-Stage Training [110.93934567725826]
  We focus on the task of procedural text understanding, which aims to comprehend such documents and track entities' states and locations during a process. Two challenges, the difficulty of commonsense reasoning and data insufficiency, still remain unsolved. We propose a novel KnOwledge-Aware proceduraL text understAnding (KOALA) model, which effectively leverages multiple forms of external knowledge.
  arXiv  Detail & Related papers  (2020-09-28T10:28:40Z)
• 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)

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.