.png){kind=icon}
.png){kind=icon}
Return
DGHSA: derivative graph-based hypergraph structure attack
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-024-79824-y.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Hypergraph Neural Networks (HGNNs) have been significantly successful in higher-order tasks. However, recent study have shown that they are also vulnerable to adversarial attacks like Graph Neural Networks. Attackers fool HGNNs by modifying node links in hypergraphs. Existing adversarial attacks on HGNNs only consider feasibility in the targeted attack, and there is no discussion on the untargeted attack with higher practicality. To close this gap, we propose a derivative graph-based hypergraph attack, namely DGHSA, which focuses on reducing the global performance of HGNNs. Specifically, DGHSA consists of two models: candidate set generation and evaluation. The gradients of the incidence matrix are obtained by training HGNNs, and then the candidate set is obtained by modifying the hypergraph structure with the gradient rules. In the candidate set evaluation module, DGHSA uses the derivative graph metric to assess the impact of attacks on the similarity of candidate hypergraphs, and finally selects the candidate hypergraph with the worst node similarity as the optimal perturbation hypergraph. We have conducted extensive experiments on four commonly used datasets, and the results show that DGHSA can significantly degrade the performance of HGNNs on node classification tasks.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.