Adversarial Attack on Community Detection by Hiding Individuals

104Citations
Citations of this article
85Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It has been demonstrated that adversarial graphs, i.e., graphs with imperceptible perturbations added, can cause deep graph models to fail on node/graph classification tasks. In this paper, we extend adversarial graphs to the problem of community detection which is much more difficult. We focus on black-box attack and aim to hide targeted individuals from the detection of deep graph community detection models, which has many applications in real-world scenarios, for example, protecting personal privacy in social networks and understanding camouflage patterns in transaction networks. We propose an iterative learning framework that takes turns to update two modules: one working as the constrained graph generator and the other as the surrogate community detection model. We also find that the adversarial graphs generated by our method can be transferred to other learning based community detection models.

Cite

CITATION STYLE

APA

Li, J., Zhang, H., Han, Z., Rong, Y., Cheng, H., & Huang, J. (2020). Adversarial Attack on Community Detection by Hiding Individuals. In The Web Conference 2020 - Proceedings of the World Wide Web Conference, WWW 2020 (pp. 917–927). Association for Computing Machinery, Inc. https://doi.org/10.1145/3366423.3380171

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free