cs.AIAug 27, 2026

A Framework for Object-Centric Predictive Monitoring of Collaborative Processes

Authors: Daniel Calegari, Andrea Delgado, Leonel Peña, Martín Rubio

Organizations: Universidad ORT Uruguay, Cuareim 1451, Montevideo, 11100, Montevideo, Uruguay · Instituto de Computación, Facultad de Ingeniería, Universidad de la República, J. Herrera y Reissig 565, Montevideo, 11300, Montevideo, Uruguay

Abstract

Predictive Process Monitoring (PPM) of collaborative, inter-organizational processes requires reasoning over multiple interdependent entities, including participants, messages, local executions, and the global collaboration case. Existing approaches extend traditional event logs with collaboration attributes but retain a single-case perspective, leaving much of this structure implicit. Object-centric process mining (OCPM) provides an alternative by representing these entities as first-class objects with explicit relations and multiple notions of case. This study connects collaborative PPM and OCPM through three contributions: (i) a formal semantic mapping from extended collaborative event logs to an OCED-conformant object-centric representation, serialized in OCEL 2.0; (ii) a reformulation of collaborative prediction tasks as object-centric prediction tasks; and (iii) a reproducible converter and prediction pipeline implementing the proposed mapping. We evaluate the framework on four public collaborative event logs and a fifth derived from the BPI Challenge 2013 incident-management log by executing the fourteen reformulated tasks using five predictive strategies across tabular, sequential, and graph-native encodings. We further discuss the benefits, limitations, and threats to the approach's validity. The representation makes collaboration structure explicit and makes it natural to state prediction targets based on object relations that fall outside the case-centric taxonomy, at the cost of increased relational complexity and dependence on object-centric tooling.

Figures & tables

Appendix figures & tables1 asset

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Sep 11, 2026

On the Potential of Multi-Task Learning in Predictive Process Monitoring

Predictive Process Monitoring (PPM) forecasts how ongoing organizational processes unfold, enabling information systems to move beyond execution support toward proactive analysis and monitoring. Although deep learning has improved prediction accuracy in PPM, most approaches follow a single-task learning (STL) setup, training a separate model per task. This increases maintenance effort and overlooks potential synergies. Multi-task learning (MTL), which jointly learns multiple prediction targets in one model, offers a promising alternative, yet its effectiveness in PPM remains underexplored. It remains unclear whether and under which settings MTL improves upon STL, which prediction tasks benefit most from joint learning, which task combinations are particularly synergistic, and if and how tasks should be balanced. To fill this gap, we present the first comprehensive empirical study of MTL for PPM, evaluating a variety of task combinations, neural architectures, and optimization methods. Overall, our results position MTL as a strong paradigm for PPM: we see substantial improvements in next-activity prediction and inherent mitigation of class imbalance using MTL, while task balancing is especially critical under low-capacity models.
Sep 13, 2026

GNN4PPM: Multi-Target Predictive Process Monitoring with Relational Graph Convolutional Networks

Predictive Process Monitoring (PPM) aims at predicting at runtime and as early as possible the future states of a process execution. Common tasks include predicting the next event, the time to completion of a trace, and outcomes. Existing approaches typically consider an event from the perspective of the executed activities along with their timestamps and case identifiers. This leads to the disadvantage that in real-life settings, there is much more information recorded in the event log that is not captured or completely ignored when performing prediction tasks. We introduce GNN4PPM, an approach that predicts all next events along with their complete data payload at once. We represent event information in a heterogeneous knowledge graph that captures the event log as an RDF semantics, and train the embeddings with a Relational Graph Convolutional Network (R-GCN). Our approach is promising in comparison to existing solutions, and experiments with state-of-the-art solutions prove the accuracy and applicability of GNN4PPM in complex settings.
Jul 2, 2026

EHHN: An Event-driven Heterogeneous Hypergraph Network for Object-Centric Next Activity Prediction

Next activity prediction helps service-oriented processes anticipate upcoming steps before delays, exceptions, or service-level risks occur. Most existing methods assume classical single-case event logs, whereas real service processes often involve events shared by multiple typed business objects. Object-centric event logs (OCELs) capture such interactions, but current predictors remain limited. Flattening-based approaches lose cross-object context, and native OCEL graph-based approaches encode multi-object events through pairwise relations. Existing models also do not jointly capture event-driven object state changes, inter-event timing, and global execution patterns. We propose EHHN, an Event-driven Heterogeneous Hypergraph Network for object-centric next activity prediction. EHHN represents each prediction prefix as a heterogeneous hypergraph, where event--object hyperedges bind retained co-participating objects and a lifecycle hyperedge groups the primary object's observed lifecycle events. Based on this representation, EHHN uses a dual-stream architecture in which a micro-spatial stream models event-driven object-state evolution and a macro-evolution stream captures temporal dynamics using retrieved global prototypes. The two streams are fused to predict the next activity. Experiments on four public OCEL benchmarks against nine baselines show that EHHN achieves the best accuracy and macro F1-score on all datasets, with improvements of up to 8.1 and 12.4 percentage points over the strongest baselines. Compared with the strongest OCEL-native graph baseline, EHHN also reduces peak GPU memory by up to 24 times. Code is available at https://github.com/chenkaitao1112/EHHN.