Process Discovery for Structured Program Synthesis
- URL: http://arxiv.org/abs/2008.05804v1
- Date: Thu, 13 Aug 2020 10:33:10 GMT
- Title: Process Discovery for Structured Program Synthesis
- Authors: Dell Zhang, Alexander Kuhnle, Julian Richardson, Murat Sensoy
- Abstract summary: A core task in process mining is process discovery which aims to learn an accurate process model from event log data.
In this paper, we propose to use (block-) structured programs directly as target process models.
We develop a novel bottom-up agglomerative approach to the discovery of such structured program process models.
- Score: 70.29027202357385
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A core task in process mining is process discovery which aims to learn an
accurate process model from event log data. In this paper, we propose to use
(block-) structured programs directly as target process models so as to
establish connections to the field of program synthesis and facilitate the
translation from abstract process models to executable processes, e.g., for
robotic process automation. Furthermore, we develop a novel bottom-up
agglomerative approach to the discovery of such structured program process
models. In comparison with the popular top-down recursive inductive miner, our
proposed agglomerative miner enjoys the similar theoretical guarantee to
produce sound process models (without deadlocks and other anomalies) while
exhibiting some advantages like avoiding silent activities and accommodating
duplicate activities. The proposed algorithm works by iteratively applying a
few graph rewriting rules to the directly-follows-graph of activities. For
real-world (sparse) directly-follows-graphs, the algorithm has quadratic
computational complexity with respect to the number of distinct activities. To
our knowledge, this is the first process discovery algorithm that is made for
the purpose of program synthesis. Experiments on the BPI-Challenge 2020 dataset
and the Karel programming dataset have demonstrated that our proposed algorithm
can outperform the inductive miner not only according to the traditional
process discovery metrics but also in terms of the effectiveness in finding out
the true underlying structured program from a small number of its execution
traces.
Related papers
- Reverse That Number! Decoding Order Matters in Arithmetic Learning [49.5504492920404]
Our work introduces a novel strategy that reevaluates the digit order by prioritizing output from the least significant digit.
Compared to the previous state-of-the-art (SOTA) method, our findings reveal an overall improvement of in accuracy while requiring only a third of the tokens typically used during training.
arXiv Detail & Related papers (2024-03-09T09:04:53Z) - Stochastic Directly-Follows Process Discovery Using Grammatical Inference [8.196011179587304]
We propose a new approach for discovering sound Directly-Follows Graphs that is grounded in grammatical inference over the input traces.
Experiments over real-world datasets confirm that our new approach can construct smaller models that represent the input traces and their frequencies more accurately than the state-of-the-art technique.
arXiv Detail & Related papers (2023-12-09T01:56:25Z) - The WHY in Business Processes: Discovery of Causal Execution Dependencies [2.0811729303868005]
Unraveling causal relationships among the execution of process activities is a crucial element in predicting the consequences of process interventions.
This work offers a systematic approach to the unveiling of the causal business process by leveraging an existing causal discovery algorithm over activity timing.
Our methodology searches for such discrepancies between the two models in the context of three causal patterns, and derives a new view in which these inconsistencies are annotated over the mined process model.
arXiv Detail & Related papers (2023-10-23T14:23:15Z) - Provably Efficient Representation Learning with Tractable Planning in
Low-Rank POMDP [81.00800920928621]
We study representation learning in partially observable Markov Decision Processes (POMDPs)
We first present an algorithm for decodable POMDPs that combines maximum likelihood estimation (MLE) and optimism in the face of uncertainty (OFU)
We then show how to adapt this algorithm to also work in the broader class of $gamma$-observable POMDPs.
arXiv Detail & Related papers (2023-06-21T16:04:03Z) - Discovering Hierarchical Process Models: an Approach Based on Events
Clustering [0.0]
We present an algorithm for discovering hierarchical process models represented as two-level workflow nets.
Unlike existing solutions, our algorithm does not impose restrictions on the process control flow and allows for iteration.
arXiv Detail & Related papers (2023-03-12T11:05:40Z) - Comparing Ordering Strategies For Process Discovery Using Synthesis
Rules [0.5330240017302619]
Process discovery aims to learn process models from observed behaviors.
In this paper, we investigate the effect of different ordering strategies on the discovered models.
arXiv Detail & Related papers (2023-01-04T16:17:52Z) - A modular software framework for the design and implementation of
ptychography algorithms [55.41644538483948]
We present SciCom, a new ptychography software framework aiming at simulating ptychography datasets and testing state-of-the-art reconstruction algorithms.
Despite its simplicity, the software leverages accelerated processing through the PyTorch interface.
Results are shown on both synthetic and real datasets.
arXiv Detail & Related papers (2022-05-06T16:32:37Z) - Procedures as Programs: Hierarchical Control of Situated Agents through
Natural Language [81.73820295186727]
We propose a formalism of procedures as programs, a powerful yet intuitive method of representing hierarchical procedural knowledge for agent command and control.
We instantiate this framework on the IQA and ALFRED datasets for NL instruction following.
arXiv Detail & Related papers (2021-09-16T20:36:21Z) - All That Glitters Is Not Gold: Towards Process Discovery Techniques with
Guarantees [1.3299507495084417]
The better the quality of the event data, the better the quality of the model that is discovered.
We demonstrate this by using a range of quality measures for both event data and discovered process models.
This paper is a call to the community of IS engineers to complement their process discovery algorithms with properties that relate qualities of their inputs to those of their outputs.
arXiv Detail & Related papers (2020-12-23T16:08:47Z) - BUSTLE: Bottom-Up Program Synthesis Through Learning-Guided Exploration [72.88493072196094]
We present a new synthesis approach that leverages learning to guide a bottom-up search over programs.
In particular, we train a model to prioritize compositions of intermediate values during search conditioned on a set of input-output examples.
We show that the combination of learning and bottom-up search is remarkably effective, even with simple supervised learning approaches.
arXiv Detail & Related papers (2020-07-28T17:46: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.