.png){kind=icon}
.png){kind=icon}
Return
Purity Skeleton Dynamic Hypergraph Neural Network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2024.128539.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, in the field of Hypergraph Neural Networks (HGNNs), the effectiveness of dynamic hypergraph construction has been validated, which aims to reduce structural noise within the hypergraph through embeddings. However, the existing dynamic construction methods fail to notice the reduction of information contained in the hypergraphs during dynamic updates. This limitation undermines the quality of hypergraphs. Moreover, dynamic hypergraphs are constructed from graphs. Several key nodes play a crucial role in graph, but they are overlooked in hypergraphs. In this paper, we propose a P urity S keleton D ynamic H ypergraph N eural N etwork (PS-DHGNN) to address the above issues. Firstly, we leverage purity skeleton method to dynamically construct hypergraphs via the fusion embeddings of features and topology simultaneously. This method effectively reduces structural noise and prevents the loss of information. Secondly, we employ an incremental training strategy, which implements a batch training strategy based on the importance of nodes. The key nodes, as the skeleton of hypergraph, are still highly valued. In addition, we utilize a novel loss function for learning structure information between hypergraph and graph. We conduct extensive experiments on node classification and clustering tasks, which demonstrate that our PS-DHGNN outperforms state-of-the-art methods. Note on real-world traffic flow datasets, PS-DHGNN demonstrates excellent performance, which is highly meaningful in practice.
Keywords:
Graph embedding
Hypergraph neural networks
Incremental learning
Granular ball
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W