TY - JOUR
T1 - Efficient Alignment Between Event Logs and Process Models
AU - Song, Wei
AU - Xia, Xiaoxu
AU - Jacobsen, Hans Arno
AU - Zhang, Pengcheng
AU - Hu, Hao
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2017/1/1
Y1 - 2017/1/1
N2 - The aligning of event logs with process models is of great significance for process mining to enable conformance checking, process enhancement, performance analysis, and trace repairing. Since process models are increasingly complex and event logs may deviate from process models by exhibiting redundant, missing, and dislocated events, it is challenging to determine the optimal alignment for each event sequence in the log, as this problem is NP-hard. Existing approaches utilize the cost-based A∗ algorithm to address this problem. However, scalability is often not considered, which is especially important when dealing with industrial-sized problems. In this paper, by taking advantage of the structural and behavioral features of process models, we present an efficient approach which leverages effective heuristics and trace replaying to significantly reduce the overall search space for seeking the optimal alignment. We employ real-world business processes and their traces to evaluate the proposed approach. Experimental results demonstrate that our approach works well in most cases, and that it outperforms the state-of-the-art approach by up to 5 orders of magnitude in runtime efficiency.
AB - The aligning of event logs with process models is of great significance for process mining to enable conformance checking, process enhancement, performance analysis, and trace repairing. Since process models are increasingly complex and event logs may deviate from process models by exhibiting redundant, missing, and dislocated events, it is challenging to determine the optimal alignment for each event sequence in the log, as this problem is NP-hard. Existing approaches utilize the cost-based A∗ algorithm to address this problem. However, scalability is often not considered, which is especially important when dealing with industrial-sized problems. In this paper, by taking advantage of the structural and behavioral features of process models, we present an efficient approach which leverages effective heuristics and trace replaying to significantly reduce the overall search space for seeking the optimal alignment. We employ real-world business processes and their traces to evaluate the proposed approach. Experimental results demonstrate that our approach works well in most cases, and that it outperforms the state-of-the-art approach by up to 5 orders of magnitude in runtime efficiency.
KW - Event logs
KW - alignment
KW - process decomposition
KW - process models
KW - trace replaying
KW - trace segmentation
UR - http://www.scopus.com/inward/record.url?scp=85012288937&partnerID=8YFLogxK
U2 - 10.1109/TSC.2016.2601094
DO - 10.1109/TSC.2016.2601094
M3 - Article
AN - SCOPUS:85012288937
SN - 1939-1374
VL - 10
SP - 136
EP - 149
JO - IEEE Transactions on Services Computing
JF - IEEE Transactions on Services Computing
IS - 1
M1 - 7546937
ER -