Time-aware Gradient Attack on Dynamic Network Link Prediction
Not on the map. Why?
Abstract (arXiv)
In network link prediction, it is possible to hide a target link from being predicted with a small perturbation on network structure. This observation may be exploited in many real world scenarios, for example, to preserve privacy, or to exploit financial security. There have been many recent studies to generate adversarial examples to mislead deep learning models on graph data. However, none of the previous work has considered the dynamic nature of real-world systems. In this work, we present the first study of adversarial attack on dynamic network link prediction (DNLP). The proposed attack method, namely time-aware gradient attack (TGA), utilizes the gradient information generated by deep dynamic network embedding (DDNE) across different snapshots to rewire a few links, so as to make DDNE fail to predict target links. We implement TGA in two ways: one is based on traversal search, namely TGA-Tra; and the other is simplified with greedy search for efficiency, namely TGA-Gre. We conduct comprehensive experiments which show the outstanding performance of TGA in attacking DNLP algorithms.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Nov 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 1; 2025: 4.
10 papers.
- 2022Motif-Backdoor: Rethinking the Backdoor Attack on Graph Neural Networks via Motifscited by 19
- 2023TrustGuard: GNN-based Robust and Explainable Trust Evaluation with Dynamicity Supportcited by 12
- 2024Learning on Graphs with Large Language Models(LLMs): A Deep Dive into Model Robustnesscited by 11
- 2023Spear and Shield: Adversarial Attacks and Defense Methods for Model-Based Link Prediction on Continuous-Time Dynamic Graphscited by 9
- 2021GraphAttacker: A General Multi-Task GraphAttack Frameworkcited by 8
- 2021Dyn-Backdoor: Backdoor Attack on Dynamic Link Predictioncited by 4
- 2025Exact Verification of Graph Neural Networks with Incremental Constraint Solvingcited by 4
- 2025Incomplete Graph Learning: A Comprehensive Surveycited by 3
- 2025Leveraging Vulnerabilities in Temporal Graph Neural Networks via Strategic High-Impact Assaultscited by 0
- 2025LoReTTA: A Low Resource Framework To Poison Continuous Time Dynamic Graphscited by 0
- 2025LoReTTA: A Low Resource Framework To Poison Continuous Time Dynamic Graphs10 Nov 2025
- 2025Leveraging Vulnerabilities in Temporal Graph Neural Networks via Strategic High-Impact Assaults29 Sep 2025
- 2025Exact Verification of Graph Neural Networks with Incremental Constraint Solving12 Aug 2025
- 2025Incomplete Graph Learning: A Comprehensive Survey18 Feb 2025
- 2024Learning on Graphs with Large Language Models(LLMs): A Deep Dive into Model Robustness16 Jul 2024
- 2023Spear and Shield: Adversarial Attacks and Defense Methods for Model-Based Link Prediction on Continuous-Time Dynamic Graphs21 Aug 2023
- 2023TrustGuard: GNN-based Robust and Explainable Trust Evaluation with Dynamicity Support23 Jun 2023
- 2022Motif-Backdoor: Rethinking the Backdoor Attack on Graph Neural Networks via Motifs25 Oct 2022
- 2021Dyn-Backdoor: Backdoor Attack on Dynamic Link Prediction8 Oct 2021
- 2021GraphAttacker: A General Multi-Task GraphAttack Framework18 Jan 2021