Dynamic meta-path guided temporal heterogeneous graph neural networks

• Main Authors: JI, Yugang, SHI, Chuan, FANG, Yuan
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2024
• Subjects: Temporal heterogeneous graph; graph neural network; dynamic meta-path; temporal importance sampling; heterogeneous mutual evolution attention; Graphics and Human Computer Interfaces; OS and Networks
• Online Access: https://ink.library.smu.edu.sg/sis_research/8926; https://ink.library.smu.edu.sg/context/sis_research/article/9929/viewcontent/DyMGNN.pdf
• Institution: Singapore Management University

Graph Neural Networks (GNNs) have become the de facto standard for representation learning on topological graphs, which usually derive effective node representations via message passing from neighborhoods. Although GNNs have achieved great success, previous models are mostly confined to static and homogeneous graphs. However, there are multiple dynamic interactions between different-typed nodes in real-world scenarios like academic networks and e-commerce platforms, forming temporal heterogeneous graphs (THGs). Limited work has been done for representation learning on THGs and the challenges are in two aspects. First, there are abundant dynamic semantics between nodes while traditional techniques like meta-paths can only capture static relevance. Second, different semantics on THGs have often mutually evolved with each other over time, making it more difficult than dynamic homogeneous graph modeling. To address this problem, here we propose the Dynamic Meta-path guided temporal heterogeneous Graph Neural Networks (DyMGNNs). To handle the dynamic semantics, we introduce the concept of dynamic meta-path which is a common base for temporal semantic search engines, and then adopt the temporal importance sampling to extract neighborhoods with temporal bias. Focusing on mutual evolution, we design the heterogeneous mutual evolution attention mechanism, which can model the fine-grained interplay of semanticlevel preferences for each node. Extensive experiments on three real-world datasets for node classification and temporal link prediction demonstrate that our method consistently outperforms state-of-the-art alternatives.