Unnoticeable Community Deception via Multi-objective Optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912563906740224 |
|---|---|
| author | Fang, Junyuan Liu, Huimin Peng, Yueqi Wu, Jiajing Zheng, Zibin Tse, Chi K. |
| author_facet | Fang, Junyuan Liu, Huimin Peng, Yueqi Wu, Jiajing Zheng, Zibin Tse, Chi K. |
| contents | Community detection in graphs is crucial for understanding the organization of nodes into densely connected clusters. While numerous strategies have been developed to identify these clusters, the success of community detection can lead to privacy and information security concerns, as individuals may not want their personal information exposed. To address this, community deception methods have been proposed to reduce the effectiveness of detection algorithms. Nevertheless, several limitations, such as the rationality of evaluation metrics and the unnoticeability of attacks, have been ignored in current deception methods. Therefore, in this work, we first investigate the limitations of the widely used deception metric, i.e., the decrease of modularity, through empirical studies. Then, we propose a new deception metric, and combine this new metric together with the attack budget to model the unnoticeable community deception task as a multi-objective optimization problem. To further improve the deception performance, we propose two variant methods by incorporating the degree-biased and community-biased candidate node selection mechanisms. Extensive experiments on three benchmark datasets demonstrate the superiority of the proposed community deception strategies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_01438 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Unnoticeable Community Deception via Multi-objective Optimization Fang, Junyuan Liu, Huimin Peng, Yueqi Wu, Jiajing Zheng, Zibin Tse, Chi K. Social and Information Networks Artificial Intelligence Neural and Evolutionary Computing Community detection in graphs is crucial for understanding the organization of nodes into densely connected clusters. While numerous strategies have been developed to identify these clusters, the success of community detection can lead to privacy and information security concerns, as individuals may not want their personal information exposed. To address this, community deception methods have been proposed to reduce the effectiveness of detection algorithms. Nevertheless, several limitations, such as the rationality of evaluation metrics and the unnoticeability of attacks, have been ignored in current deception methods. Therefore, in this work, we first investigate the limitations of the widely used deception metric, i.e., the decrease of modularity, through empirical studies. Then, we propose a new deception metric, and combine this new metric together with the attack budget to model the unnoticeable community deception task as a multi-objective optimization problem. To further improve the deception performance, we propose two variant methods by incorporating the degree-biased and community-biased candidate node selection mechanisms. Extensive experiments on three benchmark datasets demonstrate the superiority of the proposed community deception strategies. |
| title | Unnoticeable Community Deception via Multi-objective Optimization |
| topic | Social and Information Networks Artificial Intelligence Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2509.01438 |