arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.00334cs.DS
收藏

不确定事件数据的高效时空表示

Efficient Time and Space Representation of Uncertain Event Data

Marco Pegoraro, Merih Seran Uysal, Wil M. P. van der Aalst

摘要:

流程挖掘是一门涉及分析操作流程的执行数据、从事件数据中提取模型、度量事件数据与规范模型之间的一致性以及增强流程各个方面的学科。大多数方法假设事件数据是准确捕获的行为。然而,这在许多应用中是不现实的:数据可能包含不确定性,这些不确定性来自记录误差、不精确测量和其他因素。最近,已经开发了新的方法来分析包含不确定性的事件数据,这些技术主要依赖于表示不确定的事件数据,通过基于图的模型明确捕捉不确定性。在本文中,我们介绍了一种新的方法来有效地计算一个图形表示的行为包含在一个不确定的过程跟踪。我们提出了我们的新算法,证明其渐近时间复杂度,并显示实验结果,突出了数量级的性能改进的行为图建设。

英文摘要:

Process mining is a discipline which concerns the analysis of execution data of operational processes, the extraction of models from event data, the measurement of the conformance between event data and normative models, and the enhancement of all aspects of processes. Most approaches assume that event data is accurately capture behavior. However, this is not realistic in many applications: data can contain uncertainty, generated from errors in recording, imprecise measurements, and other factors. Recently, new methods have been developed to analyze event data containing uncertainty; these techniques prominently rely on representing uncertain event data by means of graph-based models explicitly capturing uncertainty. In this paper, we introduce a new approach to efficiently calculate a graph representation of the behavior contained in an uncertain process trace. We present our novel algorithm, prove its asymptotic time complexity, and show experimental results that highlight order-of-magnitude performance improvements for the behavior graph construction.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑