Skip to content

DHGNN-MVC: Dynamic heterogeneous graph neural network based on multi-view contrastive learning.

Aug 2026 · Neural Networks · Vol 205 Pt C, pp. 109549 · 0 citations · 38 references
Medicine

TL;DR

A dynamic heterogeneous graph neural network based on multi-view contrastive learning (DHGNN-MVC) that jointly optimizes the future graph reconstruction loss, local-global contrastive loss, and community evolution contrastive loss and effectively alleviates the limitations of meta-path semantic transmission within temporal snapshots is proposed.

Abstract

Dynamic heterogeneous graphs, as an important tool for characterizing multiple types of entities and their evolutionary relationships in complex systems, have been widely used in scenarios such as academic network analysis, e-commerce, and social networks. However, compared to static homogeneous graphs, the heterogeneity and temporal dynamics in dynamic heterogeneous graph data pose additional challenges for representation learning, meaning that existing dynamic heterogeneous graph learning methods still encounter the following challenges during modeling: (1) There is a problem of limited semantic propagation of meta-paths within time snapshots; (2) There is a low-order relationship bias problem caused by dynamic optimization objectives. To address the above challenges, we propose a dynamic heterogeneous graph neural network based on multi-view contrastive learning (DHGNN-MVC). Specifically, we explicitly introduce the attribute information of intermediate nodes in the meta-path during the heterogeneous information aggregation process by optimizing the meta-path semantic modeling approach. Combined with a message propagation mechanism based on the PPR matrix, this allows us to collaboratively capture both local and deep information in heterogeneous graph snapshots from the perspectives of relationships and meta-paths, thereby effectively alleviating the limitations of meta-path semantic transmission within temporal snapshots. At the same time, we propose a multi-view contrastive learning strategy that jointly optimizes the future graph reconstruction loss, local-global contrastive loss, and community evolution contrastive loss. The node representations are constrained at three scales: local structure, graph level semantics, and community level to effectively alleviate the problem of low-order relationship bias. The simulation experiments conducted on multiple real-world dynamic heterogeneous graph datasets show that the performance of DHGNN-MVC is significantly better than existing baseline methods, fully demonstrating its effectiveness and novelty in capturing the evolution laws of dynamic heterogeneous graph networks.

View source

Similar papers

Conference Open access Sep 2026

Dynamic Heterogeneous Graph Representation Learning: A Survey

This survey presents the first systematic review of DHG representation learning methods and proposes a novel algorithm-centric taxonomy that categorizes existing literature, including early embedding-based approaches, graph neural network (GNN)-based models, and relatively recent Transformer-based DHG methods, while ex...

Huan Liu, Peng-Fei Jiao, Jie Yin et al. · 0 citations
#graph neural networks Open access Aug 2026

Topology-Aware Graph Neural Network with Spatiotemporal Encoding and Contrastive Learning for Scalable Dynamic Network Representation

The implications of the proposed TAGNN framework on such applications as anomaly detection, social media analytics, and traffic forecasting are that the proposed framework provides an end-to-end solution that promotes accuracy, efficiency, and temporal consistency in dynamic graph learning.

Wassan Hayale, R. S. Ali, Raghda Abd Ul Rab Abd Ul Hasan et al. · 0 citations
2026

SIHAN: Semantic-Instance Guided Hypergraph Attention Network With Dual-View Contrastive Learning for Heterogeneous Graph

Heterogeneous graphs are well-suited to modeling the diverse types of entities and their complex interactions in the real world. However, existing Heterogeneous Graph Neural Networks (HGNNs) are typically based on the binary message-passing framework, which struggles to explicitly and finely describe the higher-order s...

Shu-Juan Wei, Hui-Jun Tang, Peng-Fei Jiao et al. · 0 citations
Open access Sep 2026

From Topology to Cognition: A Unified Graph-Driven Framework for Scalable Intelligent Data Mining

Modern data are increasingly represented and utilized as interconnected networks, including collaboration graphs, multi-relational user–item interactions, and schema-less knowledge graphs that support retrieval-augmented generation pipelines. While graph analytics has become a key foundation for intelligent data mining...

Yao Hu, Qian Huang · 0 citations

An Integration of Fuzzy-Enhanced Heterophilic Graph Representation Learning for Improving Performance of Link Prediction

Extensive experiments ensure that FHGE consistently outperforms state-of-the-art baselines and demonstrate the power of fuzzy-driven learning in improving graph embedding quality and establish FHGE as a promising solution for real-world link prediction tasks.

Linh Nguyen Thi My, Tham Vo · 3 citations

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