Unsupervised Euclidean Distance Attack on Network Embedding
arXiv:1905.11015
Abstract
Considering the wide application of network embedding methods in graph data mining, inspired by the adversarial attack in deep learning, this paper proposes a Genetic Algorithm (GA) based Euclidean Distance Attack strategy (EDA) to attack the network embedding, so as to prevent certain structural information from being discovered. EDA focuses on disturbing the Euclidean distance between a pair of nodes in the embedding space as much as possible through minimal modifications of the network structure. Since a large number of downstream network algorithms, such as community detection and node classification, rely on the Euclidean distance between nodes to evaluate the similarity between them in the embedding space, EDA can be considered as a universal attack on a variety of network algorithms. Different from traditional supervised attack strategies, EDA does not need labeling information, and, in other words, is an unsupervised network embedding attack method.
References in corpus (9)
- Efficient Estimation of Word Representations in Vector Space
- Distributed Representations of Words and Phrases and their Compositionality
- Modularity and community structure in networks
- Community detection in graphs
- Near linear time algorithm to detect community structures in large-scale networks
- Adversarial Attacks on Neural Networks for Graph Data
- Fast Gradient Attack on Network Embedding
- Attack Graph Convolutional Networks by Adding Fake Nodes
- Data Poisoning Attack against Unsupervised Node Embedding Methods