Community Concealment from Unsupervised Graph Learning-Based Clustering

• URL: http://arxiv.org/abs/2602.12250v1
• Date: Thu, 12 Feb 2026 18:36:19 GMT
• Title: Community Concealment from Unsupervised Graph Learning-Based Clustering
• Authors: Dalyapraz Manatova, Pablo Moriano, L. Jean Camp,
• Abstract summary: We study a defensive setting in which a data publisher seeks to conceal a community of interest while making limited, utility-aware changes in the network.<n>We present a perturbation strategy that rewires a set of selected edges and modifies node features to reduce the distinctiveness leveraged by GNN message passing.
• Score: 3.2371089062298317
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph neural networks (GNNs) are designed to use attributed graphs to learn representations. Such representations are beneficial in the unsupervised learning of clusters and community detection. Nonetheless, such inference may reveal sensitive groups, clustered systems, or collective behaviors, raising concerns regarding group-level privacy. Community attribution in social and critical infrastructure networks, for example, can expose coordinated asset groups, operational hierarchies, and system dependencies that could be used for profiling or intelligence gathering. We study a defensive setting in which a data publisher (defender) seeks to conceal a community of interest while making limited, utility-aware changes in the network. Our analysis indicates that community concealment is strongly influenced by two quantifiable factors: connectivity at the community boundary and feature similarity between the protected community and adjacent communities. Informed by these findings, we present a perturbation strategy that rewires a set of selected edges and modifies node features to reduce the distinctiveness leveraged by GNN message passing. The proposed method outperforms DICE in our experiments on synthetic benchmarks and real network graphs under identical perturbation budgets. Overall, it achieves median relative concealment improvements of approximately 20-45% across the evaluated settings. These findings demonstrate a mitigation strategy against GNN-based community learning and highlight group-level privacy risks intrinsic to graph learning.

Related papers

• Community detection robustness of graph neural networks [19.213455157528912]
  Graph neural networks (GNNs) are increasingly used for community detection in attributed networks.<n>We evaluate six widely adopted GNN architectures: GCN, GAT, Graph- SAGE, DiffPool, MinCUT, and DMoN.<n> supervised GNNs tend to achieve higher baseline accuracy, while unsupervised methods, particularly DMoN, maintain stronger resilience.
  arXiv  Detail & Related papers  (2025-09-29T12:08:22Z)
• Evading Overlapping Community Detection via Proxy Node Injection [11.711770540233337]
  We address the problem of emphcommunity membership hiding (CMH), which seeks edge modifications that cause a target node to exit its original community.<n>We propose a deep reinforcement learning approach that learns effective modification policies, including the use of proxy nodes, while preserving graph structure.
  arXiv  Detail & Related papers  (2025-09-25T14:21:16Z)
• Non-Dissipative Graph Propagation for Non-Local Community Detection [14.99394337842476]
  We introduce the Unsupervised Antisymmetric Graph Neural Network (uAGNN), a novel unsupervised community detection approach.<n>We show uAGNN's superior performance in high and medium heterophilic settings, where traditional methods fail to exploit long-range dependencies.<n>These results highlight uAGNN's potential as a powerful tool for unsupervised community detection in diverse graph environments.
  arXiv  Detail & Related papers  (2025-08-15T12:26:48Z)
• Cluster-Aware Attacks on Graph Watermarks [50.19105800063768]
  We introduce a cluster-aware threat model in which adversaries apply community-guided modifications to evade detection.<n>Our results show that cluster-aware attacks can reduce attribution accuracy by up to 80% more than random baselines.<n>We propose a lightweight embedding enhancement that distributes watermark nodes across graph communities.
  arXiv  Detail & Related papers  (2025-04-24T22:49:28Z)
• GNNBleed: Inference Attacks to Unveil Private Edges in Graphs with Realistic Access to GNN Models [2.714583452862024]
  This paper investigates edge privacy in contexts where adversaries possess only black-box access to the target GNN model.<n>We present a range of attacks that leverage the message-passing mechanism of GNNs.
  arXiv  Detail & Related papers  (2023-11-03T20:26:03Z)
• Ranking-based Group Identification via Factorized Attention on Social Tripartite Graph [68.08590487960475]
  We propose a novel GNN-based framework named Contextualized Factorized Attention for Group identification (CFAG) We devise tripartite graph convolution layers to aggregate information from different types of neighborhoods among users, groups, and items. To cope with the data sparsity issue, we devise a novel propagation augmentation layer, which is based on our proposed factorized attention mechanism.
  arXiv  Detail & Related papers  (2022-11-02T01:42:20Z)
• Uncovering the Structural Fairness in Graph Contrastive Learning [87.65091052291544]
  Graph contrastive learning (GCL) has emerged as a promising self-supervised approach for learning node representations. We show that representations obtained by GCL methods are already fairer to degree bias than those learned by GCN. We devise a novel graph augmentation method, called GRAph contrastive learning for DEgree bias (GRADE), which applies different strategies to low- and high-degree nodes.
  arXiv  Detail & Related papers  (2022-10-06T15:58:25Z)
• Neural Bandit with Arm Group Graph [37.651541940052724]
  Contextual bandits aim to identify among a set of arms the optimal one with the highest reward based on their contextual information. We introduce a new model, Arm Group Graph (AGG), where the nodes represent the groups of arms and the weighted edges formulate the correlations among groups. To leverage the rich information in AGG, we propose a bandit algorithm, AGG-UCB, where the neural networks are designed to estimate rewards.
  arXiv  Detail & Related papers  (2022-06-08T02:16:11Z)
• Mixed Graph Contrastive Network for Semi-Supervised Node Classification [63.924129159538076]
  We propose a novel graph contrastive learning method, termed Mixed Graph Contrastive Network (MGCN)<n>In our method, we improve the discriminative capability of the latent embeddings by an unperturbed augmentation strategy and a correlation reduction mechanism.<n>By combining the two settings, we extract rich supervision information from both the abundant nodes and the rare yet valuable labeled nodes for discriminative representation learning.
  arXiv  Detail & Related papers  (2022-06-06T14:26:34Z)
• A Variational Edge Partition Model for Supervised Graph Representation Learning [51.30365677476971]
  This paper introduces a graph generative process to model how the observed edges are generated by aggregating the node interactions over a set of overlapping node communities. We partition each edge into the summation of multiple community-specific weighted edges and use them to define community-specific GNNs. A variational inference framework is proposed to jointly learn a GNN based inference network that partitions the edges into different communities, these community-specific GNNs, and a GNN based predictor that combines community-specific GNNs for the end classification task.
  arXiv  Detail & Related papers  (2022-02-07T14:37:50Z)
• Interpretable Signed Link Prediction with Signed Infomax Hyperbolic Graph [54.03786611989613]
  signed link prediction in social networks aims to reveal the underlying relationships (i.e. links) among users (i.e. nodes) We develop a unified framework, termed as Signed Infomax Hyperbolic Graph (textbfSIHG) In order to model high-order user relations and complex hierarchies, the node embeddings are projected and measured in a hyperbolic space with a lower distortion.
  arXiv  Detail & Related papers  (2020-11-25T05:09:03Z)
• On the Impact of Communities on Semi-supervised Classification Using Graph Neural Networks [0.5872014229110213]
  We systematically study the impact of community structure on the performance of GNNs in semi-supervised node classification on graphs. Our results suggest that communities typically have a major impact on the learning process and classification performance.
  arXiv  Detail & Related papers  (2020-10-30T13:17:38Z)
• Amortized Probabilistic Detection of Communities in Graphs [39.56798207634738]
  We propose a simple framework for amortized community detection. We combine the expressive power of GNNs with recent methods for amortized clustering. We evaluate several models from our framework on synthetic and real datasets.
  arXiv  Detail & Related papers  (2020-10-29T16:18:48Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.