We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2001.07933")
get_code_for_paper("2001.07933")
have("2001.07933")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2001.07933.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2001.07933)
Connect an agent — have() is free.