Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 3424-3435· 0 citations· 36 references
TL;DR
Experiments demonstrate that CATGX strikes a good balance to generate explanations that are faithful, grounded and confounder-aware, and outperform existing TGNN explainers in efficiency with 83x speed up.
Abstract
Interpreting predictions of temporal graph neural networks (TGNNs) is challenging: structural patterns are entangled with temporal dynamics and node-level activity. Existing methods often overemphasize frequent or recent interactions, producing explanations that conflate structural influence with temporal or behavioral confounding and are not grounded by motif-level evidence. We propose CATGX, a confounder-aware framework for explaining temporal graph predictions through motif-level reasoning. CATGX models temporal interaction mechanisms as motif occurrences, and explicitly treats temporal context and entity activity as observed confounders. By abstracting causal factors into temporal motif, context, and entity codebooks, CATGX applies an adjustment-inspired scoring scheme that compares motif-level influence to isolate structural contributions that persist across comparable conditions. To support fast explanation generation, CATGX integrates graph approximate nearest neighbor (ANN) sampling strategy as an unbiased motif occurrence statistics estimator, which preserves unbiased estimation through importance weighting. The entire pipeline operates in a training-free, model-agnostic manner and achieves bounded, low polynomial-time cost. Experiments demonstrate that CATGX strikes a good balance to generate explanations that are faithful, grounded and confounder-aware, and outperform existing TGNN explainers in efficiency with 83x speed up.
BridgeMem is introduced, which estimates the value of explicit dyadic transition modeling as a residual added to the log scores of a frozen full-vocabulary forecaster, and shows the value of explicit dyadic transition modeling in temporal knowledge graph forecasting.
Zeyan Li, Li-Bing Chen, Sheng-Da Zhuo et al.· 0 citations
Graph neural networks have shown strong potential for learning structural representations of biological networks. However, repeated message passing may blur local structural signals that are relevant for motif- and graphlet-based analysis. This paper investigates multilabel graphlet classification in protein–protein in...
Lidija Kunst, Friedhelm Schwenker, H. Kestler· Entropy· 0 citations
Identifying influential spreaders in temporal networks is essential for understanding and controlling information and disease propagation. Among existing centrality methods, local methods have gained considerable attention due to their computational efficiency and their ability to identify influential spreaders usi...
Srestha Sadhu, Amrita Namtirtha, Ramya D. Shetty et al.· Scientific Reports· 0 citations
Experiments on PeMS03, PeMS04, and PeMS08 show that CausalST achieves the lowest MAPE among all compared methods while remaining competitive in MAE and RMSE, and ablation results reveal non-additive interactions between directed weighting and delayed aggregation.
A novel Dual-Channel Hybrid Graph Neural Network (HyGNN) that jointly models temporal dynamics and high-order structural dependencies and robustly captures the nonlinear interplay between mobility and sociality.
Liang Chen, Xiang Li, Gui-Yuan Jiang et al.· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.