arXiv:2609.14534v1 Announce Type: new
Abstract: Predictive Process Monitoring (PPM) aims at predicting at runtime and as early as possible the future states of a process execution. Common tasks inclu...
By Ana Costa, Johannes M\"akelburg, Luise Pufahl
arXiv:2607. 01785v1 Announce Type: new Abstract: Next activity prediction helps service-oriented processes anticipate upcoming steps before delays, exceptions, or service-level risks occur.
By Jiaxing Wang, Kaitao Chen, Zhubin Han, Chenyu Hou, Bin Cao, Jing Fan, Ji Zhang
arXiv:2607. 27797v1 Announce Type: new Abstract: Predictive process monitoring (PPM) leverages event logs to forecast the future of running process instances, for instance, predicting the next activity, the remaining time until case completion, or the time to the next event.
By Lennart Fertig, Lukas Kirchdorfer, Tobias Sesterhenn
The paper introduces SiamSA-PPM, a self‑supervised framework that augments event logs for predictive process monitoring by generating realistic trace variants using control‑flow semantics and frequent behavioral patterns. It combines Siamese learning with statistically grounded data augmentation to learn generalizable prefix representations without requiring labeled data. Experiments on diverse real‑world logs show that SiamSA-PPM matches or outperforms state‑of‑the‑art baselines in next‑activity and final‑outcome prediction tasks.
By Sjoerd van Straten, Alessandro Padella, Marwan Hassani
arXiv:2507. 22524v3 Announce Type: replace Abstract: We propose HGCN(O), a self-tuning toolkit using Graph Convolutional Network (GCN) models for event sequence prediction.
By Fang Wang, Paolo Ceravolo, Ernesto Damiani
arXiv:2606. 15868v1 Announce Type: new Abstract: Next activity prediction (NAP) is a cornerstone of predictive process monitoring (PPM), enabling organizations to move from retrospective analysis to proactive process steering.
By Hans Weytjens, Ingo Weber
arXiv:2609.24579v1 Announce Type: new
Abstract: Event logs arise in a wide range of real-world processes, capturing not only event activities and timestamps but also multi-modal contextual informatio...
By Fabian Spaeh, Jingxing Fang, Shandian Zhe, Bin Shen
arXiv:2606. 18726v1 Announce Type: cross Abstract: Structurally constrained event sequence generation remains challenging because generated paths must preserve transition feasibility, temporal order, termination, and attribute consistency.
By Fang Wang, Ernesto Damiani
The paper introduces the Foundation Event Predictor (FEP), a scalable in‑context architecture that performs next‑event prediction across diverse event logs using learned, event‑level nonparametric inference. FEP employs causal self‑attention to encode context and target histories, cross‑attention for relevance‑weighted aggregation, and permutation‑robust embedding learning to decouple event IDs from semantics. Trained on 696 real‑world datasets and evaluated on 50 unseen ones, FEP generalizes effectively to new systems without parameter adaptation, often matching or surpassing models trained separately on each target dataset.
arXiv:2610.17503v1 Announce Type: cross
Abstract: Event logs are ubiquitous across real-world domains, including business processes, manufacturing workflows, healthcare, and many other operational sy...
By Fabian Spaeh, Sean Jaffe, Shandian Zhe, Bin Shen
MISApp is a profile‑free framework that predicts the next mobile app a user will launch by learning multi‑hop session graphs. It captures transition dependencies across different structural ranges, incorporates temporal context and spatial categorization, and models intent evolution from recent interactions. Experiments on two real‑world datasets show MISApp outperforms baselines in both standard and cold‑start settings while remaining efficient, and analyses reveal that multi‑hop relations provide higher‑order predictive signals and interpretable attention weights.
By Yunchi Yang, Longlong Li, Jianliang Wu, Cunquan Qu
The paper presents a model‑centric evaluation framework for process discovery that uses node embeddings and Procrustes alignment to compare Petri net models across different datasets. By transforming Petri nets into graph representations, the method computes a bounded cosine‑distance metric that unifies fitness and precision assessments and remains robust to noise. Experiments on real and synthetic logs demonstrate that the embedding‑based indicator outperforms traditional conformance metrics and is sensitive to model degradation while providing activity‑level deviation localization.