This work proposes a unified mathematical framework capable of capturing varying degrees of complexity across temporal graphs that is flexible and expressive enough to accommodate a wide range of network structures and temporal dynamics.
Abstract
Temporal graphs are increasingly used to model dynamic systems in diverse domains such as social networks, financial networks, and traffic networks. Predicting both what the next event will be and when it will occur in these systems is crucial for understanding and anticipating complex behaviors, but has not been studied much. To address this gap, we propose a unified mathematical framework capable of capturing varying degrees of complexity across temporal graphs. Our framework is flexible and expressive enough to accommodate a wide range of network structures and temporal dynamics. Building upon this analysis, we introduce our novel approach for jointly predicting the next event and its occurrence time. Empirical evaluations across multiple datasets demonstrate that our method consistently outperforms existing techniques, particularly in scenarios involving irregular event patterns and complex temporal dependencies. These findings highlight the potential of our framework as a robust foundation for future research in temporal event prediction.
A novel theoretical model, namely the multiway autoregressive (MARS) model, which characterizes multiple evolutionary paths by capturing dependencies within and across two core factors underlying diverse evolutionary mechanisms is proposed, which develops a general DGNN framework, a multiway autoregressive network (MAN).
Ping He, Xiao-hua Xu· IEEE Transactions on Neural...· 0 citations
Effective public event forecasting is essential for intelligent service systems, enabling proactive risk management, adaptive resource allocation, and timely decision-making. In many real-world scenarios, the evolution of public events is driven by dynamic interactions among participants. Motivated by this observation, this paper proposes auto-ibDLM, a network-driven deep learning framework that represents events as dynamic interaction networks and predicts public event evolution through participant growth forecasting. The proposed framework adopts a hybrid representation learning strategy that first represents network evolution using network science-informed structural metrics and subsequently transforms the resulting structural feature vectors into compact and robust latent representations through an auto-learning layer. A GRU-based temporal forecasting module is then employed to capture temporal dependencies and predict future participant growth. Extensive experiments on 13 real-world public event datasets and two publicly available dynamic network datasets demonstrate that auto-ibDLM consistently outperforms representative state-of-the-art methods in both forecasting accuracy and generalization capability, achieving over 97% accuracy in public event forecasting. Comprehensive experimental analyses further validate the effectiveness of the proposed hybrid representation learning strategy and demonstrate its representation-level interpretability. These results indicate that auto-ibDLM provides an effective and practical solution for intelligent public event forecasting.
Jie Wei, Yue Liu, Xiaochuan Tang et al.· 0 citations
This paper introduces a dynamic role discovery technique in temporal dynamic networks, utilizing temporally regularized Non-negative Matrix Factorization (NMF). Our technique differs from existing dynamic role analysis techniques by creating a consistent set of roles across all time periods, as well as a universal transition matrix that describes the probability of transitioning between roles. We also apply a regularization penalty to ensure that role membership does not change dramatically between time periods making our model more robust against real-world noise. We test our data on five real-world and one synthetically simulated dataset using both engineered and automatically generated features. We demonstrate that the proposed regularized role detection method, for appropriate regularization weight parameter reduces prediction errors compared to other techniques. Furthermore, trace analysis of the transition matrices indicates that our method yields a more stable system, that is, individuals are more likely to stay in their roles with fewer arbitrary transitions. Our model learns time-aligned roles, captures behavioral transitions over time, and scales efficiently to large and sparse graphs.
E. Evans, Weihong Guo, Carlotta Domenicon· 0 citations
Event prediction is an important task for applications such as risk assessment and resource allocation. However, it is non-trivial to model the past due to the complexity and heterogeneity of available data. In recent years, Graph Neural Networks (GNNs) have shown flexibility in processing different forms of data and have been applied for event forecasting because events can be formalized as temporal graph. Although the GNN-based methods have achieved impressive performance, they still have limitations in event prediction task. First, different types of data such as graph and text have not been fully utilized and the contextual information has not been effectively exploited. Secondly, GNNs typically take individual snapshots of temporal graphs as input, which restricts their ability to learn long-term dependencies. To address these problems, we propose a temporal graph embedding learning model, named TGELN. It consists of two major modules, data processor and event predictor. The former processes records of event databases and creates an event-based temporal graph. The latter adopts a novel semantics-enhanced graph neural network that incorporates semantic information as well as other text features to learn temporal graph embedding for event prediction. Extensive experiments are conducted on eight datasets of events between countries, and the results demonstrate the superiority of the proposed model compared to the baseline methods.
The framework gives a nonparametric baseline for dynamic network analysis with explicit convergence guarantees and establishes nonparametric convergence rates in both block-model and Holder-smooth regimes.
Charles Dufour, S. Olhede· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.