2020
DOI: 10.1109/access.2020.3033450
|View full text |Cite
|
Sign up to set email alerts
|

Adversarial System Variant Approximation to Quantify Process Model Generalization

Abstract: In process mining, process models are extracted from event logs using process discovery algorithms and are commonly assessed using multiple quality metrics. While the metrics that measure the relationship of an extracted process model to its event log are well-studied, quantifying the level by which a process model can describe the unobserved behavior of its underlying system falls short in the literature. In this paper, a novel deep learning-based methodology called Adversarial System Variant Approximation (A… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3
3
2

Relationship

2
6

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 48 publications
0
10
0
Order By: Relevance
“…Adversarial networks generalization. A recent generalization measure proposed in [10] uses sequence generative adversarial networks and the Metropolis-Hastings algorithm to sample unobserved trace variants based on the trace distribution of the input event log. The generalization is then computed as the harmonic mean between the fitness and the precision of the process model and the newly computed trace variants.…”
Section: Generalization Measuresmentioning
confidence: 99%
“…Adversarial networks generalization. A recent generalization measure proposed in [10] uses sequence generative adversarial networks and the Metropolis-Hastings algorithm to sample unobserved trace variants based on the trace distribution of the input event log. The generalization is then computed as the harmonic mean between the fitness and the precision of the process model and the newly computed trace variants.…”
Section: Generalization Measuresmentioning
confidence: 99%
“…Given an event log, the process discovery problem consists of constructing a model that represents the behavior recorded in the log [1]. For example, suppose that L = [adeef 10 , addef, abbbcf 5 , abcf 20 , adef 20 , adefabcfadef 10 ] is an event log, with superscripts indicating multiplicity. Then L contains six distinct traces and 66 traces in total, with trace addef occurring only once, and traces abcf and adef both occurring twenty times.…”
Section: B Process Discoverymentioning
confidence: 99%
“…To resolve those tensions, we make use of a semiparametric bootstrap, borrowing initial ideas for estimating distributions of traces from Theis and Darabi [10] (see Section V). The semiparametric bootstrap assumes that the true population consists of elements similar but not necessarily identical to those in the original sample; another interpretation is that a semiparametric sample is a nonparametric sample with a certain amount of "noise" allowed.…”
Section: Log Samplingmentioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, the limitation ineluctably highlights the importance of obtaining trustworthy process models. Therefore, future work is anticipated to continue ongoing research efforts to assess the generalization of process models [6], [28] towards the discovery of process models that describe the realistic behavior of the underlying system.…”
mentioning
confidence: 99%