Detecting sudden and gradual drifts in business processes from execution
traces
- URL: http://arxiv.org/abs/2005.04016v1
- Date: Thu, 7 May 2020 16:22:11 GMT
- Title: Detecting sudden and gradual drifts in business processes from execution
traces
- Authors: Abderrahmane Maaradji, Marlon Dumas, Marcello La Rosa, and Alireza
Ostovar
- Abstract summary: Business process drift detection refers to a family of methods to detect changes in a business process.
This paper proposes an automated and statistically grounded method for detecting sudden and gradual business process drifts.
- Score: 0.5424799109837066
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Business processes are prone to unexpected changes, as process workers may
suddenly or gradually start executing a process differently in order to adjust
to changes in workload, season, or other external factors. Early detection of
business process changes enables managers to identify and act upon changes that
may otherwise affect process performance. Business process drift detection
refers to a family of methods to detect changes in a business process by
analyzing event logs extracted from the systems that support the execution of
the process. Existing methods for business process drift detection are based on
an explorative analysis of a potentially large feature space and in some cases
they require users to manually identify specific features that characterize the
drift. Depending on the explored feature space, these methods miss various
types of changes. Moreover, they are either designed to detect sudden drifts or
gradual drifts but not both. This paper proposes an automated and statistically
grounded method for detecting sudden and gradual business process drifts under
a unified framework. An empirical evaluation shows that the method detects
typical change patterns with significantly higher accuracy and lower detection
delay than existing methods, while accurately distinguishing between sudden and
gradual drifts.
Related papers
- Process Variant Analysis Across Continuous Features: A Novel Framework [0.0]
This research addresses the challenge of effectively segmenting cases within operational processes.
We present a novel approach employing a sliding window technique combined with the earth mover's distance to detect changes in control flow behavior.
We validate our methodology through a real-life case study in collaboration with UWV, the Dutch employee insurance agency.
arXiv Detail & Related papers (2024-05-06T16:10:13Z) - 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) - 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) - A Monitoring and Discovery Approach for Declarative Processes Based on
Streams [0.0]
We present a discovery algorithm that extracts declarative processes as Dynamic Condition Response (DCR) graphs from event streams.
Streams are monitored to generate temporal representations of the process, later processed to generate declarative models.
arXiv Detail & Related papers (2022-08-10T14:25:35Z) - Gradual Drift Detection in Process Models Using Conformance Metrics [0.0]
We will focus on the automatic detection of gradual drifts, a special type of change, in which the cases of two models overlap during a period of time.
The proposed algorithm relies on conformance checking metrics to carry out the automatic detection of the changes, performing also a fully automatic classification of these changes into sudden or gradual.
The approach has been validated with a synthetic dataset consisting of 120 logs with different distributions of changes, getting better results in terms of detection and classification accuracy, delay and change region overlapping than the main state-of-the-art algorithms.
arXiv Detail & Related papers (2022-07-22T10:56:35Z) - 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) - Prescriptive Process Monitoring: Quo Vadis? [64.39761523935613]
The paper studies existing methods in this field via a Systematic Literature Review ( SLR)
The SLR provides insights into challenges and areas for future research that could enhance the usefulness and applicability of prescriptive process monitoring methods.
arXiv Detail & Related papers (2021-12-03T08:06:24Z) - Tracking the risk of a deployed model and detecting harmful distribution
shifts [105.27463615756733]
In practice, it may make sense to ignore benign shifts, under which the performance of a deployed model does not degrade substantially.
We argue that a sensible method for firing off a warning has to both (a) detect harmful shifts while ignoring benign ones, and (b) allow continuous monitoring of model performance without increasing the false alarm rate.
arXiv Detail & Related papers (2021-10-12T17:21:41Z) - Bandit Quickest Changepoint Detection [55.855465482260165]
Continuous monitoring of every sensor can be expensive due to resource constraints.
We derive an information-theoretic lower bound on the detection delay for a general class of finitely parameterized probability distributions.
We propose a computationally efficient online sensing scheme, which seamlessly balances the need for exploration of different sensing options with exploitation of querying informative actions.
arXiv Detail & Related papers (2021-07-22T07:25:35Z) - Change Point Detection in Time Series Data using Autoencoders with a
Time-Invariant Representation [69.34035527763916]
Change point detection (CPD) aims to locate abrupt property changes in time series data.
Recent CPD methods demonstrated the potential of using deep learning techniques, but often lack the ability to identify more subtle changes in the autocorrelation statistics of the signal.
We employ an autoencoder-based methodology with a novel loss function, through which the used autoencoders learn a partially time-invariant representation that is tailored for CPD.
arXiv Detail & Related papers (2020-08-21T15:03:21Z) - Adversarial System Variant Approximation to Quantify Process Model
Generalization [2.538209532048867]
In process mining, process models are extracted from event logs and are commonly assessed using multiple quality dimensions.
A novel deep learning-based methodology called Adversarial System Variant Approximation (AVATAR) is proposed to overcome this issue.
arXiv Detail & Related papers (2020-03-26T22:06:18Z)
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.