Metraipolis › archive › dc_ba7cc0bc744f

Complete Suffix Prediction for Recommendation via Latent Retrieval over Process Graphs — arXiv:2609.15692

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15692
License (as archived)
CC0-1.0
Archived
2026-10-16T02:15:16.239Z
SHA-256 of the archived text
83388444ad79e19662f4f25682aa0981078f4c2bb4a1daacb7c86cbf7ec3735f
Stable URL of this page
https://metraipolis.com/documento/dc_ba7cc0bc744f

How to cite

Complete Suffix Prediction for Recommendation via Latent Retrieval over Process Graphs — arXiv:2609.15692 — arXiv (en), https://arxiv.org/abs/2609.15692 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ba7cc0bc744f (Metraipolis archive dc_ba7cc0bc744f, sha256 83388444ad79e19662f4f25682aa0981078f4c2bb4a1daacb7c86cbf7ec3735f)
BibTeX
@misc{dcba7cc0bc744f,
  title = {Complete Suffix Prediction for Recommendation via Latent Retrieval over Process Graphs — arXiv:2609.15692},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15692},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ba7cc0bc744f; sha256 83388444ad79e19662f4f25682aa0981078f4c2bb4a1daacb7c86cbf7ec3735f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15692. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Complete suffix prediction is challenging in sequential decision settings, where the same prefix can remain compatible with several plausible suffixes. We propose a graphbased metric-learning framework that reformulates complete suffix prediction as latent retrieval over process graphs. Prefixes and suffixes are represented as directed attributed graphs and encoded by edge-conditioned graph neural networks, allowing event-level activities and transition-level durations to be modelled jointly. Prefix representations are projected into the latent suffix space through a predictor trained with a joint reconstruction and contrastive objective strengthened using process-aware hard negatives. To stabilise the learned retrieval geometry, spectral normalisation, and retrieval robustness, spectral normalisation is applied to enforce a Lipschitz constraint on both encoders and predictor. Experiments on two real-life process datasets demonstrate that the proposed framework achieves the best overall results across nearly all evaluated criteria. It improves semantic suffix accuracy measured by normalized Damerau-Levenshtein distance, yields strong retrieval quality through Recall@1, Recall@5, and MRR@5, and maintains temporal plausibility according to Mean Absolute Error. These results show that graph-based latent retrieval is an effective alternative to sequential suffix prediction for recommendation-oriented process monitoring under structural and KPI-related constraints.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.NE).
Categorie arXiv: Neural and Evolutionary Computing (cs.NE).
Pagina del lavoro: https://arxiv.org/abs/2609.15692 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T01:53:36.910Z dalla pagina https://arxiv.org/catchup/cs.NE/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).