Adversarial Attack on Network Embeddings via Supervised Network Poisoning
arXiv:2102.07164
Abstract
Learning low-level node embeddings using techniques from network representation learning is useful for solving downstream tasks such as node classification and link prediction. An important consideration in such applications is the robustness of the embedding algorithms against adversarial attacks, which can be examined by performing perturbation on the original network. An efficient perturbation technique can degrade the performance of network embeddings on downstream tasks. In this paper, we study network embedding algorithms from an adversarial point of view and observe the effect of poisoning the network on downstream tasks. We propose VIKING, a supervised network poisoning strategy that outperforms the state-of-the-art poisoning methods by upto 18% on the original network structure. We also extend VIKING to a semi-supervised attack setting and show that it is comparable to its supervised counterpart.
13 pages, 2 tables, 3 figures, PAKDD 2021
References in corpus (11)
- Efficient Estimation of Word Representations in Vector Space
- Fast unfolding of communities in large networks
- Benchmark graphs for testing community detection algorithms
- Graph Embedding Techniques, Applications, and Performance: A Survey
- Adversarial Attacks on Neural Networks for Graph Data
- Adversarial Attacks and Defences: A Survey
- Deep Text Classification Can be Fooled
- Adversarial Attacks on Graph Neural Networks via Meta Learning
- Adversarial Attacks on Node Embeddings via Graph Poisoning
- Adversarial Attack on Graph Structured Data
- A Tutorial on Network Embeddings