Temporal GNNs for Remaining Time Prediction: An Evaluation

Predicting the remaining time of a business process instance is crucial for enhancing operational decision-making. Sequential and tabular predictive process monitoring (PPM) methods often fail to capture the dynamic, graph-structured nature of real-world processes. In this work, we investigate the effectiveness of temporal graph networks (TGN) for the remaining time prediction. This addresses the critical gap between static graph-based methods and the temporal dynamics in real-world processes. We propose (1) a framework for representing processes as continuoustime temporal graphs, (2) an adapted TGN architecture that leverages both structural and temporal process information to predict remaining times, and (3) a comprehensive empirical evaluation using statistical methods and domain experts comparing our approach against state-of-the-art PPM methods to quantify improvements in remaining time prediction. Our results demonstrate that TGNs outperform state-of-the-art methods, achieving up to $3.7 \%$ improvement in MAE and $13.4 \%$ in RMSE, demonstrating the effectiveness of temporal graph modeling in PPM.

Authors

Institutions

Publication Details

Published
2025-10-20
DOI
https://doi.org/10.1109/icpm66919.2025.11220740
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Temporal GNNs for Remaining Time Prediction: An Evaluation

Michael Möhring, Rainer Schmidt, Marc C. Hennig
Advanced Graph Neural Networks
article

Temporal GNNs for Remaining Time Prediction: An Evaluation

Michael Möhring, Rainer Schmidt, Marc C. Hennig
article en

Abstract

Predicting the remaining time of a business process instance is crucial for enhancing operational decision-making. Sequential and tabular predictive process monitoring (PPM) methods often fail to capture the dynamic, graph-structured nature of real-world processes. In this work, we investigate the effectiveness of temporal graph networks (TGN) for the remaining time prediction. This addresses the critical gap between static graph-based methods and the temporal dynamics in real-world processes. We propose (1) a framework for representing processes as continuoustime temporal graphs, (2) an adapted TGN architecture that leverages both structural and temporal process information to predict remaining times, and (3) a comprehensive empirical evaluation using statistical methods and domain experts comparing our approach against state-of-the-art PPM methods to quantify improvements in remaining time prediction. Our results demonstrate that TGNs outperform state-of-the-art methods, achieving up to $3.7 \%$ improvement in MAE and $13.4 \%$ in RMSE, demonstrating the effectiveness of temporal graph modeling in PPM.

Munich University of Applied Sciences (DE), Reutlingen University (DE)
Openalex Percentile: Top 83%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.