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.
|Title of host publication||Business Process Management (11th International Conference, BPM 2013, Beijing, China, August 26-30, 2013. Proceedings)|
|Editors||F. Daniel, J. Wang, B. Weber|
|Place of Publication||Berlin|
|Publication status||Published - 2013|
|Name||Lecture Notes in Computer Science|
Munoz-Gama, J., Carmona, J., & Aalst, van der, W. M. P. (2013). Conformance checking in the large : partitioning and topology. In F. Daniel, J. Wang, & B. Weber (Eds.), Business Process Management (11th International Conference, BPM 2013, Beijing, China, August 26-30, 2013. Proceedings) (pp. 130-145). (Lecture Notes in Computer Science; Vol. 8094). Springer. https://doi.org/10.1007/978-3-642-40176-3_11