Efficient Time and Space Representation of Uncertain Event Data
Algorithms, vol. 13, pp. 285
Abstract
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 captured 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.
Authors 3
-
Affiliation as printed
Process and Data Science Group (PADS), Department of Computer Science, RWTH Aachen University, 52062 Aachen, Germany
-
Affiliation as printed
Process and Data Science Group (PADS), Department of Computer Science, RWTH Aachen University, 52062 Aachen, Germany
-
Affiliation as printed
Process and Data Science Group (PADS), Department of Computer Science, RWTH Aachen University, 52062 Aachen, Germany
RWTH Aachen University
Cited by 0 stored of 0
No patents citing this paper on Lens.org (checked 2026-10-06).