Process discovery algorithms aim to capture process orchestration models from event logs. These algorithms have been designed for logs in which events that belong to the same case are related to each other - and to that case - by means of a unique case identifier. However, in service oriented systems these case identifiers are usually not stored beyond request-response pairs, which makes it hard to relate events that belong to the same case. This is known as the correlation challenge. This paper addresses the correlation challenge by introducing a new process discovery algorithm, called the correlation miner, that facilitates process discovery when events are not associated with a case identifier. Experiments performed on both synthetic and real-world event logs show the applicability of the correlation miner.
CITATION STYLE
Pourmirza, S., Dijkman, R., & Grefen, P. (2015). Correlation mining: Mining process orchestrations without case identifiers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9435, pp. 237–252). Springer Verlag. https://doi.org/10.1007/978-3-662-48616-0_15
Mendeley helps you to discover research relevant for your work.