Feature-Community-guided DICE (FCom-DICE), a perturbation strategy built on DICE that rewires a set of structurally influential edges and adjusts node features to reduce the distinctiveness exploited by GNN message passing is introduced.
Abstract
Graph neural networks (GNNs) enable powerful unsupervised learning of communities. However, such inference may inadvertently expose sensitive group structures, critical clustered patterns, or collective behaviors, raising concerns about sensitive group-level privacy. In social and critical infrastructure networks, unauthorized community inference can reveal coordinated asset groups, operational hierarchies, and system dependencies that may be exploited for reconnaissance or profiling. We study a defensive setting in which a network (or defender) operator seeks to conceal a community of interest while making only small, utility-preserving modifications to the network. Our analysis shows that community concealment depends on two measurable factors: the connectivity at the community boundary and the feature similarity between the protected community and its neighbors. Guided by these observations, we introduce Feature-Community-guided DICE (FCom-DICE), a perturbation strategy built on DICE (Disconnect Internally Connect Externally) that rewires a set of structurally influential edges and adjusts node features to reduce the distinctiveness exploited by GNN message passing. Across synthetic benchmarks and real network graphs such as Facebook, Wikipedia, and Bitcoin Transactions, FCom-DICE consistently outperforms structure-only DICE under the same perturbation budgets. The largest improvements are observed for communities that are weakly connected to the rest of the network and well separated in feature space. These gains are achieved while preserving key structural and feature characteristics of the original network. These results demonstrate the effectiveness of feature-aware perturbations for reducing the recoverability of targeted communities under GNN-based community inference.
Community detection reveals meso-scale structure in graphs but can inadvertently expose sensitive affiliations and operational patterns. We study community structure deception (CSD) as a budgeted edge-perturbation problem on directed networks, aiming to reduce the recoverability of communities under heterogeneous detec...
Saif Aldeen Madi, Giuseppe Pirrò· IEEE Transactions on Computa...· 0 citations
: Social network platforms have become primary channels for information dissemination, yet they are increasingly exploited by anomalous users such as bots, fake accounts, and coordinated disinformation spreaders. These malicious actors manipulate public opinion, spread misinformation and undermine platform integrity, p...
Zehan Li, Yingyi Li, Zhi-Wei Tang et al.· Computers, Materials & C...· 0 citations
Many real-world networks, such as social and biological networks, exhibit community structures. Community detection algorithms extract valuable insights from these networks by identifying densely connected groups, enabling applications such as recommendation, behavior understanding, and system optimization. However, gr...
Yue Yang, Zhuoyan Yang, Yutong Liu et al.· International Conferences on...· 0 citations
Graph embeddings offer a principled way to discover coordinated attack patterns in security telemetry, but their hyperparameters are typically inherited from social-network benchmarks without validation. We conduct a systematic sensitivity analysis of Node2Vec on a heterogeneous security event graph derived from produc...
Moazzam Khan, A. W. Malik, Mohammad-Ali Omer· 2026 IEEE Cloud Summit· 0 citations
Community detection aims to uncover mesoscopic organization in graphs by grouping nodes into densely connected communities, and it plays an important role in analyzing citation networks, social systems, and other complex relational data. In practice, this task is challenging because community structures are determined...
Chuanpeng Wang, Dong Li, Ruyi Qiu et al.· Journal of King Saud Univers...· 0 citations
This work demonstrates that an adversary can use the generator-discriminator technique to reconstruct high-quality graphs in real-world black-box attack scenarios against GNNs, and shows that GNNs are highly vulnerable to privacy attacks, varying Laplacian noise-scales.
A. Keji, S. Dibbo· arXiv.org· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
Microsoft Research Blog· microsoft.comOct 12, 2026
StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.