Conformance checking in the large: Partitioning and topology

41Citations
Citations of this article
72Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The torrents of event data generated by today's systems are an important enabler for process mining. However, at the same time, the size and variability of the resulting event logs are challenging for today's process mining techniques. This paper focuses on "conformance checking in the large" and presents a novel decomposition technique that partitions larger processes into sets of subprocesses that can be analyzed more easily. The resulting topological representation of the partitioning can be used to localize conformance problems. Moreover, we provide techniques to refine the decomposition such that similar process fragments are not considered twice during conformance analysis. All the techniques have been implemented in ProM, and experimental results are provided. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Munoz-Gama, J., Carmona, J., & Van Der Aalst, W. M. P. (2013). Conformance checking in the large: Partitioning and topology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8094 LNCS, pp. 130–145). https://doi.org/10.1007/978-3-642-40176-3_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free