Evading Community Detection via Counterfactual Neighborhood Search

• URL: http://arxiv.org/abs/2310.08909v2
• Date: Fri, 7 Jun 2024 20:34:53 GMT
• Title: Evading Community Detection via Counterfactual Neighborhood Search
• Authors: Andrea Bernini, Fabrizio Silvestri, Gabriele Tolomei,
• Abstract summary: Community detection is useful for social media platforms to discover tightly connected groups of users who share common interests. Some users may wish to preserve their anonymity and opt out of community detection for various reasons, such as affiliation with political or religious organizations, without leaving the platform. In this study, we address the challenge of community membership hiding, which involves strategically altering the structural properties of a network graph to prevent one or more nodes from being identified by a given community detection algorithm.
• Score: 10.990525728657747
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Community detection techniques are useful for social media platforms to discover tightly connected groups of users who share common interests. However, this functionality often comes at the expense of potentially exposing individuals to privacy breaches by inadvertently revealing their tastes or preferences. Therefore, some users may wish to preserve their anonymity and opt out of community detection for various reasons, such as affiliation with political or religious organizations, without leaving the platform. In this study, we address the challenge of community membership hiding, which involves strategically altering the structural properties of a network graph to prevent one or more nodes from being identified by a given community detection algorithm. We tackle this problem by formulating it as a constrained counterfactual graph objective, and we solve it via deep reinforcement learning. Extensive experiments demonstrate that our method outperforms existing baselines, striking the best balance between accuracy and cost.

Related papers

• Private Online Community Detection for Censored Block Models [60.039026645807326]
  We study the private online change detection problem for dynamic communities, using a censored block model (CBM) We propose an algorithm capable of identifying changes in the community structure, while maintaining user privacy.
  arXiv  Detail & Related papers  (2024-05-09T12:35:57Z)
• Transaction Fraud Detection via an Adaptive Graph Neural Network [64.9428588496749]
  We propose an Adaptive Sampling and Aggregation-based Graph Neural Network (ASA-GNN) that learns discriminative representations to improve the performance of transaction fraud detection. A neighbor sampling strategy is performed to filter noisy nodes and supplement information for fraudulent nodes. Experiments on three real financial datasets demonstrate that the proposed method ASA-GNN outperforms state-of-the-art ones.
  arXiv  Detail & Related papers  (2023-07-11T07:48:39Z)
• Cross-Network Social User Embedding with Hybrid Differential Privacy Guarantees [81.6471440778355]
  We propose a Cross-network Social User Embedding framework, namely DP-CroSUE, to learn the comprehensive representations of users in a privacy-preserving way. In particular, for each heterogeneous social network, we first introduce a hybrid differential privacy notion to capture the variation of privacy expectations for heterogeneous data types. To further enhance user embeddings, a novel cross-network GCN embedding model is designed to transfer knowledge across networks through those aligned users.
  arXiv  Detail & Related papers  (2022-09-04T06:22:37Z)
• Relational Graph Neural Networks for Fraud Detection in a Super-App environment [53.561797148529664]
  We propose a framework of relational graph convolutional networks methods for fraudulent behaviour prevention in the financial services of a Super-App. We use an interpretability algorithm for graph neural networks to determine the most important relations to the classification task of the users. Our results show that there is an added value when considering models that take advantage of the alternative data of the Super-App and the interactions found in their high connectivity.
  arXiv  Detail & Related papers  (2021-07-29T00:02:06Z)
• Community Detection for Access-Control Decisions: Analysing the Role of Homophily and Information Diffusion in Online Social Networks [0.0]
  Access-Control Lists (ACLs) are one of the most important privacy features of Online Social Networks (OSNs) This work investigates the use of community-detection algorithms for the automatic generation of ACLs in OSNs.
  arXiv  Detail & Related papers  (2021-04-19T08:49:59Z)
• Hide and Seek: Outwitting Community Detection Algorithms [17.144388833011536]
  Community affiliation plays an important role in determining a node's contextual position in a network. This study focuses on hiding such sensitive communities so that the community affiliation of the targeted nodes can be concealed. We introduce NEURAL, a novel method that greedily optimize a node-centric objective function to determine the rewiring strategy.
  arXiv  Detail & Related papers  (2021-02-22T03:50:44Z)
• A multilevel clustering technique for community detection [0.0]
  This study presents a novel detection method based on a scalable framework to identify related communities in a network. We propose a multilevel clustering technique (MCT) that leverages structural and textual information to identify local communities termed microcosms. The approach offers a better understanding and clarity toward describing how low-level communities evolve and behave on Twitter.
  arXiv  Detail & Related papers  (2021-01-16T23:26:44Z)
• Certified Robustness of Community Detection against Adversarial Structural Perturbation via Randomized Smoothing [81.71105567425275]
  We develop the first certified robustness guarantee of community detection against adversarial structural perturbation. We theoretically show that the smoothed community detection method provably groups a given arbitrary set of nodes into the same community. We also empirically evaluate our method on multiple real-world graphs with ground truth communities.
  arXiv  Detail & Related papers  (2020-02-09T18:39:39Z)
• Adversarial Attack on Community Detection by Hiding Individuals [68.76889102470203]
  We focus on black-box attack and aim to hide targeted individuals from the detection of deep graph community detection models. 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.
  arXiv  Detail & Related papers  (2020-01-22T09:50:04Z)

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.