Name
Abstract | ||
|---|---|---|
Optimal alignments are the basis of conformance checking. For long, researchers have been devoted to the efficiency issue of computing optimal alignments. This paper focuses on the optimality issue. Specifically, we aim to find alignments with maximum synchronous moves and minimum deviations. This paper introduces a coordinate-plane search space, which allows enumerating all the possible alignments. The alignments with maximum synchronous moves are translated into the lowest-cost paths, such that heuristic strategies (such as the Dijkstra algorithm) can be applied. Both theoretical proof and experimental results show that 100% optimality can be achieved. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.ins.2022.04.056 | Information Sciences |
Keywords | DocType | Volume |
Conformance check,Optimal alignments,Heuristic strategy,Synchronous moves,Business process models,Event logs | Journal | 604 |
ISSN | Citations | PageRank |
0020-0255 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hui Yan | 1 | 0 | 0.34 |
| Uzay Kaymak | 2 | 762 | 78.45 |
| Pieter Van Gorp | 3 | 736 | 46.91 |
| Xudong Lu | 4 | 0 | 0.34 |
| Shan Nan | 5 | 0 | 0.34 |
| Duan Huilong | 6 | 17 | 7.85 |