Figure: The Overall Architecture of the Proposed HTGCL.
Abstract Graph Neural Networks (GNNs) have attracted extensive attention in recent years due to the powerful representation capabilities for graph-structured data. Existing GNNs mainly focus on static homogeneous graph. However, complex systems in the real world often contain multiple types of dynamically evolving entities and relationships, which are more suitable for modeling as Heterogeneous Temporal Graphs (HTGs). Currently, HTG representation learning methods mainly focus on the semi-supervised learning paradigm, which suffers from the problems of expensive supervisory information and poor generalization. Aiming at the above problems, this paper proposes a globally enhanced GNN for HTG based on contrastive learning. Specifically, this paper uses a heterogeneous hierarchical attention mechanism to generate proximity-preserving node representations based on historical information. Furthermore, contrastive learning is used to maximize the mutual information between temporal local and global graph representations, enriching the global semantic information of node representations. The experimental results show that the self-supervised HTG representation learning method proposed in this paper improves the AUC on the link prediction task of multiple real-world datasets by an average of 3.95%.
dgl==1.1.1
numpy==1.25.0
scikit_learn==1.3.0
torch==2.0.1
matplotlib==3.7.1
networkx==2.8.4
pandas==2.0.3
scipy==1.10.1
seaborn==0.12.2
tensorflow==2.13.0
torch==2.0.1
torch_geometric==2.3.1
torch_scatter==2.1.1
tqdm==4.65.0
python main.py htgcl --dataset yelp