Conformance Checking Approximation using Subset Selection and Edit Distance

12/02/2019
by   Mohammadreza Fani Sani, et al.
0

Conformance checking techniques let us find out to what degree a process model and real execution data correspond to each other. In recent years, alignments have proven extremely useful in calculating conformance statistics. Most techniques to compute alignments provide an exact solution. However, in many applications, it is enough to have an approximation of the conformance value. Specifically, for large event data, the computing time for alignments is considerably long using current techniques which makes them inapplicable in reality. Also, it is no longer feasible to use standard hardware for complex processes. Hence, we need techniques that enable us to obtain fast, and at the same time, accurate approximation of the conformance values. This paper proposes new approximation techniques to compute approximated conformance checking values close to exact solution values in a faster time. Those methods also provide upper and lower bounds for the approximated alignment value. Our experiments on real event data show that it is possible to improve the performance of conformance checking by using the proposed methods compared to using the state-of-the-art alignment approximation technique. Results show that in most of the cases, we provide tight bounds, accurate approximated alignment values, and similar deviation statistics.

READ FULL TEXT
research
03/23/2021

Model Independent Error Bound Estimation for Conformance Checking Approximation

Conformance checking techniques allow us to quantify the correspondence ...
research
12/22/2020

Scalable Online Conformance Checking Using Incremental Prefix-Alignment Computation

Conformance checking techniques aim to collate observed process behavior...
research
12/23/2021

A Framework for Efficient Memory Utilization in Online Conformance Checking

Conformance checking (CC) techniques of the process mining field gauge t...
research
06/28/2020

Lookahead-Bounded Q-Learning

We introduce the lookahead-bounded Q-learning (LBQL) algorithm, a new, p...
research
02/14/2020

Online Process Monitoring Using Incremental State-Space Expansion: An Exact Algorithm

The execution of (business) processes generates valuable traces of event...
research
09/29/2020

Alignment Approximation for Process Trees

Comparing observed behavior (event data generated during process executi...
research
11/30/2022

I Will Survive: An Online Conformance Checking Algorithm Using Decay Time

Process executions in organizations generate a large variety of data. Pr...

Please sign up or login with your details

Forgot password? Click here to reset