进程树的对齐近似
Alignment Approximation for Process Trees
摘要:
将观察到的行为(流程执行过程中生成的事件数据)与建模的行为(流程模型)进行比较,是流程挖掘分析中必不可少的一步。对齐是计算一致性检查统计信息的事实标准技术。然而,比对的计算在计算上是复杂的,因为最短路径问题必须在随着模型的大小和观察到的行为非线性增长的状态空间上求解,导致众所周知的状态空间爆炸问题。在本文中,我们提出了一种新的框架,利用其层次结构的过程树近似对齐。流程树是一种重要的流程模型形式主义,被最先进的流程挖掘技术(如归纳挖掘方法)所使用。我们的方法利用给定的进程树的结构特性,并将对齐计算问题拆分为更小的子问题。最后,将子结果组合以获得对齐。我们的实验表明,我们的方法提供了一个很好的平衡精度和计算时间。
英文摘要:
Comparing observed behavior (event data generated during process executions) with modeled behavior (process models), is an essential step in process mining analyses. Alignments are the de-facto standard technique for calculating conformance checking statistics. However, the calculation of alignments is computationally complex since a shortest path problem must be solved on a state space which grows non-linearly with the size of the model and the observed behavior, leading to the well-known state space explosion problem. In this paper, we present a novel framework to approximate alignments on process trees by exploiting their hierarchical structure. Process trees are an important process model formalism used by state-of-the-art process mining techniques such as the inductive mining approaches. Our approach exploits structural properties of a given process tree and splits the alignment computation problem into smaller sub-problems. Finally, sub-results are composed to obtain an alignment. Our experiments show that our approach provides a good balance between accuracy and computation time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。