Event-case correlation for process mining using probabilistic optimization

被引:8
作者
Bayomie, Dina [1 ,2 ]
Di Ciccio, Claudio [3 ]
Mendling, Jan [4 ]
机构
[1] Vienna Univ Econ & Business, Welthandelspl 1, A-1020 Vienna, Austria
[2] Cairo Univ, Gamaa St 1, Giza 12613, Egypt
[3] Sapienza Univ Rome, Viale Regina Elena 295, I-00161 Rome, Italy
[4] Humboldt Univ, Unter Linden 6, D-10099 Berlin, Germany
关键词
Process mining; Event correlation; Simulated annealing; Constraints; Association rules; PROCESS MODELS; CONFORMANCE CHECKING; AUTOMATED DISCOVERY; ANALYTICS; ACCURATE;
D O I
10.1016/j.is.2023.102167
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Process mining supports the analysis of the actual behavior and performance of business processes using event logs. An essential requirement is that every event in the log must be associated with a unique case identifier (e.g., the order ID of an order-to-cash process). In reality, however, this case identifier may not always be present, especially when logs are acquired from different systems or extracted from non-process-aware information systems. In such settings, the event log needs to be pre-processed by grouping events into cases - an operation known as event correlation. Existing techniques for correlating events have worked with assumptions to make the problem tractable: some assume the generative processes to be acyclic, while others require heuristic information or user input. Moreover, they abstract the log to activities and timestamps, and miss the opportunity to use data attributes. In this paper, we lift these assumptions and propose a new technique called EC-SA-Data based on probabilistic optimization. The technique takes as inputs a sequence of timestamped events (the log without case IDs), a process model describing the underlying business process, and constraints over the event attributes. Our approach returns an event log in which every event is associated with a case identifier. The technique allows users to flexibly incorporate rules on process knowledge and data constraints. The approach minimizes the misalignment between the generated log and the input process model, maximizes the support of the given data constraints over the correlated log, and the variance between activity durations across cases. Our experiments with various real-life datasets show the advantages of our approach over the state of the art.(c) 2023 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页数:28
相关论文
共 81 条
[51]  
Leemans S., 2014, P BPM WORKSH SPRING
[52]  
Leemans S.J.J., 2014, P INT C BUS PROC MAN, P66
[53]   Fast and Accurate Business Process Drift Detection [J].
Maaradji, Abderrahmane ;
Dumas, Marlon ;
La Rosa, Marcello ;
Ostovar, Alireza .
BUSINESS PROCESS MANAGEMENT, BPM 2015, 2015, 9253 :406-422
[54]  
Maggi Fabrizio M., 2012, Advanced Information Systems Engineering. Proceedings 24th International Conference, CAiSE 2012, P270, DOI 10.1007/978-3-642-31095-9_18
[55]   Balanced multi-perspective checking of process conformance [J].
Mannhardt, Felix ;
de Leoni, Massimiliano ;
Reijers, Hajo A. ;
van der Aalst, Wil M. P. .
COMPUTING, 2016, 98 (04) :407-437
[56]   Detection of batch activities from event logs [J].
Martin, Niels ;
Pufahl, Luise ;
Mannhardt, Felix .
INFORMATION SYSTEMS, 2021, 95
[57]  
Mendling J., 2021, THEORY PRACTICE ALGO
[58]   An Artifact-Driven Approach to Monitor Business Processes Through Real-World Objects [J].
Meroni, Giovanni ;
Di Ciccio, Claudio ;
Mendling, Jan .
SERVICE-ORIENTED COMPUTING, ICSOC 2017, 2017, 10601 :297-313
[59]   Event correlation for process discovery from web service interaction logs [J].
Motahari-Nezhad, Hamid Reza ;
Saint-Paul, Regis ;
Casati, Fabio ;
Benatallah, Boualem .
VLDB JOURNAL, 2011, 20 (03) :417-444
[60]   A guided tour to approximate string matching [J].
Navarro, G .
ACM COMPUTING SURVEYS, 2001, 33 (01) :31-88