Hypergraph-Based Dynamic Graph Node Classification

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Ma, Xiaoxu, Zhao, Chen, Shao, Minglai, Lin, Yujie
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866913628828991488
author Ma, Xiaoxu
Zhao, Chen
Shao, Minglai
Lin, Yujie
author_facet Ma, Xiaoxu
Zhao, Chen
Shao, Minglai
Lin, Yujie
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2412_20321
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Hypergraph-Based Dynamic Graph Node Classification
Ma, Xiaoxu
Zhao, Chen
Shao, Minglai
Lin, Yujie
Social and Information Networks
Artificial Intelligence
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.
title Hypergraph-Based Dynamic Graph Node Classification
topic Social and Information Networks
Artificial Intelligence
url https://arxiv.org/abs/2412.20321