Automated Repair of Process Models with Non-Local Constraints Using
State-Based Region Theory
- URL: http://arxiv.org/abs/2106.15398v1
- Date: Sat, 26 Jun 2021 21:14:04 GMT
- Title: Automated Repair of Process Models with Non-Local Constraints Using
State-Based Region Theory
- Authors: Anna Kalenkova, Josep Carmona, Artem Polyvyanyy, Marcello La Rosa
- Abstract summary: State-of-the-art process discovery methods construct free-choice process models from event logs.
We propose a novel approach for enhancing free-choice process models by adding non-free-choice constructs discovered a-posteriori via region-based techniques.
- Score: 0.19499120576896226
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: State-of-the-art process discovery methods construct free-choice process
models from event logs. Consequently, the constructed models do not take into
account indirect dependencies between events. Whenever the input behaviour is
not free-choice, these methods fail to provide a precise model. In this paper,
we propose a novel approach for enhancing free-choice process models by adding
non-free-choice constructs discovered a-posteriori via region-based techniques.
This allows us to benefit from the performance of existing process discovery
methods and the accuracy of the employed fundamental synthesis techniques. We
prove that the proposed approach preserves fitness with respect to the event
log while improving the precision when indirect dependencies exist. The
approach has been implemented and tested on both synthetic and real-life
datasets. The results show its effectiveness in repairing models discovered
from event logs.
Related papers
- Bisimulation Learning [55.859538562698496]
We compute finite bisimulations of state transition systems with large, possibly infinite state space.
Our technique yields faster verification results than alternative state-of-the-art tools in practice.
arXiv Detail & Related papers (2024-05-24T17:11:27Z) - Neural Abstractions [72.42530499990028]
We present a novel method for the safety verification of nonlinear dynamical models that uses neural networks to represent abstractions of their dynamics.
We demonstrate that our approach performs comparably to the mature tool Flow* on existing benchmark nonlinear models.
arXiv Detail & Related papers (2023-01-27T12:38:09Z) - MACE: An Efficient Model-Agnostic Framework for Counterfactual
Explanation [132.77005365032468]
We propose a novel framework of Model-Agnostic Counterfactual Explanation (MACE)
In our MACE approach, we propose a novel RL-based method for finding good counterfactual examples and a gradient-less descent method for improving proximity.
Experiments on public datasets validate the effectiveness with better validity, sparsity and proximity.
arXiv Detail & Related papers (2022-05-31T04:57:06Z) - Error-based Knockoffs Inference for Controlled Feature Selection [49.99321384855201]
We propose an error-based knockoff inference method by integrating the knockoff features, the error-based feature importance statistics, and the stepdown procedure together.
The proposed inference procedure does not require specifying a regression model and can handle feature selection with theoretical guarantees.
arXiv Detail & Related papers (2022-03-09T01:55:59Z) - Process Discovery Using Graph Neural Networks [2.6381163133447836]
We introduce a technique for training an ML-based model D using graphal neural networks.
D translates a given input event log into a sound Petri net.
We show that training D on synthetically generated pairs of input logs and output models allows D to translate previously unseen synthetic and several real-life event logs into sound.
arXiv Detail & Related papers (2021-09-13T10:04:34Z) - Nonlinear Hawkes Process with Gaussian Process Self Effects [3.441953136999684]
Hawkes processes are used to model time--continuous point processes with history dependence.
Here we propose an extended model where the self--effects are of both excitatory and inhibitory type.
We continue the line of work of Bayesian inference for Hawkes processes, and our approach dispenses with the necessity of estimating a branching structure for the posterior.
arXiv Detail & Related papers (2021-05-20T09:20:35Z) - COMBO: Conservative Offline Model-Based Policy Optimization [120.55713363569845]
Uncertainty estimation with complex models, such as deep neural networks, can be difficult and unreliable.
We develop a new model-based offline RL algorithm, COMBO, that regularizes the value function on out-of-support state-actions.
We find that COMBO consistently performs as well or better as compared to prior offline model-free and model-based methods.
arXiv Detail & Related papers (2021-02-16T18:50:32Z) - Conformance Checking of Mixed-paradigm Process Models [1.8122712065585906]
Mixed-paradigm process models integrate strengths of procedural and declarative representations like Petri nets and Declare.
A key research challenge for the proliferation of mixed-paradigm models for process mining is the lack of corresponding conformance checking techniques.
We devise the first approach that works with intertwined state spaces of mixed-paradigm models.
arXiv Detail & Related papers (2020-11-23T17:04:33Z) - Model-based Policy Optimization with Unsupervised Model Adaptation [37.09948645461043]
We investigate how to bridge the gap between real and simulated data due to inaccurate model estimation for better policy optimization.
We propose a novel model-based reinforcement learning framework AMPO, which introduces unsupervised model adaptation.
Our approach achieves state-of-the-art performance in terms of sample efficiency on a range of continuous control benchmark tasks.
arXiv Detail & Related papers (2020-10-19T14:19:42Z) - Control as Hybrid Inference [62.997667081978825]
We present an implementation of CHI which naturally mediates the balance between iterative and amortised inference.
We verify the scalability of our algorithm on a continuous control benchmark, demonstrating that it outperforms strong model-free and model-based baselines.
arXiv Detail & Related papers (2020-07-11T19:44:09Z) - Amortized Bayesian model comparison with evidential deep learning [0.12314765641075436]
We propose a novel method for performing Bayesian model comparison using specialized deep learning architectures.
Our method is purely simulation-based and circumvents the step of explicitly fitting all alternative models under consideration to each observed dataset.
We show that our method achieves excellent results in terms of accuracy, calibration, and efficiency across the examples considered in this work.
arXiv Detail & Related papers (2020-04-22T15:15:46Z)
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.