Skip to content

Dynamic graph representation learning based on multi-scale attention.

Sep 2026 · Neural Networks · Vol 205 Pt C, pp. 109603 · 0 citations · 33 references
Medicine

TL;DR

A Multi-scale Attention-based Dynamic Graph Network (MADGN) integrating structure-aware modeling and hierarchical attention is proposed, which outperforms state-of-the-art baselines on dynamic link prediction, dynamic new link prediction, and node classification tasks.

Abstract

Dynamic graph representation learning aims to learn informative and predictive node representations from evolving graph structures and node attributes. Although existing methods achieve promising results for modeling structural evolution and temporal dependencies, they often emphasize only a subset of the relevant structural or temporal information and lack a unified framework to jointly extract local topology, high-order structural similarity, node attribute dynamics, and multi-scale temporal dependencies. To fill this gap, we propose a Multi-scale Attention-based Dynamic Graph Network (MADGN) integrating structure-aware modeling and hierarchical attention. First, MADGN builds a time-aware hypergraph with structural descriptors and a temporal decay function to capture high-order correlations between structurally similar non-adjacent nodes. Next, Local Structure Attention and Temporal Feature Attention separately model fine-grained neighborhood topology and time-varying node attributes. We fuse these complementary embeddings via Long-Term Attention Fusion to capture long-range spatiotemporal evolutionary patterns, and design a dual-objective loss to jointly preserve connective proximity and structural similarity in the embedding space. Experiments on four real-world dynamic graph datasets validate that MADGN outperforms state-of-the-art baselines on dynamic link prediction, dynamic new link prediction, and node classification tasks. Our model achieves up to 6.17% relative AUC improvement for dynamic new link prediction, as well as maximum 14.5% Accuracy (ACC) and 7.9% AUC gains for node classification, while retaining efficient training overhead.

View source

Similar papers

Open access Sep 2026

Unsupervised Representation Learning with Adaptive Multi-Order Structural Graph Fusion

High-dimensional unlabeled data often contain complex latent structures that are easily obscured by redundant features, noise, and unreliable neighborhood relationships. Although graph-based learning provides an effective means of preserving sample relationships, most existing methods mainly rely on first-order neighbo...

Can-Yu Zhang, Yun-Jing Zhang, Jia-Wen Sun et al. · 0 citations
Sep 2026

Spectral-temporal dual view graph convolutional networks: A deep learning framework for dynamic bipartite graphs.

Dynamic bipartite graphs (DBGs) are widely used in real-world scenarios, where representation learning is particularly challenging due to the heterogeneity of node types and the temporal evolution of interactions. A key difficulty lies in jointly capturing non-stationary micro-level preference dynamics and macro-level...

Zhe-Zhe Xing, Yu-Xin Ye, Zi-Heng Li et al. · 0 citations
#graph neural networks Open access Sep 2026

PSEALP: patch-based structural external attention with node memory for dynamic link prediction

Dynamic link prediction on temporal graphs is fundamental to many applications such as recommendation, knowledge base completion, and user–item interaction modeling. Most existing dynamic graph neural networks (DGNNs), including memory-based and attention-based models, operate on node-level embeddings and local tempora...

Da-Wei Liu · 0 citations
Open access Aug 2026

SimGAT: structure-aware graph attention network with multi-scale structural embedding

SimGAT, a structure-aware graph attention model built on SimRank-derived structural embeddings, is proposed, which computes structural similarity in the SimRank2Vec embedding space and injects it as a topological prior into the graph attention mechanism, enabling neighborhood aggregation to be jointly guided by node at...

Chengda Xu, Yinglong Zhang · 0 citations
Book Open access Aug 2026

CaN: A Core-aware Neural Framework for Attributed Hypergraph Generation

CaN is proposed, a core-aware neural generation framework for attributed hypergraphs that integrates the hierarchical k-core structure as an explicit generative prior and uses deep neural encoders to model dependencies among multi-dimensional node attributes.

Xiangfei Fang, Ran Bao, Heng Zhang · 0 citations

Scalable and Expressive Graph Representation Learning with Temporal, Structural, and Zero-Shot Capabilities

Graph representation learning has emerged as a foundational discipline within modern data science, essential for modeling the complex relational systems ubiquitous in domains from social networks to bioinformatics. However, conventional approaches, particularly Graph Neural Networks (GNN), exhibit significant limitatio...

Justin Carpenter · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.