用超图建模动态图节点变化,提升分类精度
Hypergraph-Based Dynamic Graph Node Classification
- 构建个体与群体两级超图捕捉时空依赖
- 在5个真实数据集上超越现有方法
- 适合处理节点属性与拓扑随时间变化的任务
静态图上的节点分类已取得显著进展,但针对节点拓扑、属性和标签随时间变化的动态图,准确分类仍具挑战。现有基于RNN和自注意力的方法仅聚合同一节点在不同时间片的特征,难以充分捕捉动态图中多样的变化模式。为此,我们提出一种新模型——超图驱动的多粒度动态图节点分类(HYDG)。通过GNN主干网络获取各时间片的基本节点表示后,HYDG利用两个模块建模动态图中的节点表示:个体级超图捕捉单个节点间的时空表示,群体级超图则捕捉同类别节点间的多粒度群体时序表示。每个超边通过连接特定时间范围内的多个节点,捕获不同长度的时序依赖关系。通过超图神经网络加权信息传播与聚合,获得更精确的表示。在五个真实动态图数据集上,使用两种GNN主干进行的大量实验验证了该框架的优越性。
原文摘要 · Abstract (English)
Node classification on static graphs has achieved significant success, but achieving accurate node classification on dynamic graphs where node topology, attributes, and labels change over time has not been well addressed. Existing methods based on RNNs and self-attention only aggregate features of the same node across different time slices, which cannot adequately address and capture the diverse dynamic changes in dynamic graphs. Therefore, we propose a novel model named Hypergraph-Based Multi-granularity Dynamic Graph Node Classification (HYDG). After obtaining basic node representations for each slice through a GNN backbone, HYDG models the representations of each node in the dynamic graph through two modules. The individual-level hypergraph captures the spatio-temporal node representations between individual nodes, while the group-level hypergraph captures the multi-granularity group temporal representations among nodes of the same class. Each hyperedge captures different temporal dependencies of varying lengths by connecting multiple nodes within specific time ranges. More accurate representations are obtained through weighted information propagation and aggregation by the hypergraph neural network. Extensive experiments on five real dynamic graph datasets using two GNN backbones demonstrate the superiority of our proposed framework.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。