mlsanityData to 7 Oct 2026

Adversarial Socialbots Modeling Based on Structural Information Principles

arXiv 2312.08098 ↗First posted 13 Dec 2023cs.SI cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

The importance of effective detection is underscored by the fact that socialbots imitate human behavior to propagate misinformation, leading to an ongoing competition between socialbots and detectors. Despite the rapid advancement of reactive detectors, the exploration of adversarial socialbot modeling remains incomplete, significantly hindering the development of proactive detectors. To address this issue, we propose a mathematical Structural Information principles-based Adversarial Socialbots Modeling framework, namely SIASM, to enable more accurate and effective modeling of adversarial behaviors. First, a heterogeneous graph is presented to integrate various users and rich activities in the original social network and measure its dynamic uncertainty as structural entropy. By minimizing the high-dimensional structural entropy, a hierarchical community structure of the social network is generated and referred to as the optimal encoding tree. Secondly, a novel method is designed to quantify influence by utilizing the assigned structural entropy, which helps reduce the computational cost of SIASM by filtering out uninfluential users. Besides, a new conditional structural entropy is defined between the socialbot and other users to guide the follower selection for network influence maximization. Extensive and comparative experiments on both homogeneous and heterogeneous social networks demonstrate that, compared with state-of-the-art baselines, the proposed SIASM framework yields substantial performance improvements in terms of network influence (up to 16.32%) and sustainable stealthiness (up to 16.29%) when evaluated against a robust detector with 90% accuracy.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 21 of its 37 references that are in the map. First posted on arXiv 13 Dec 2023.

Builds on

21 of 37 references.

References · 21

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  3. 2014The Rise of Social Botscited by 96
  4. 2017Online Human-Bot Interactions: Detection, Estimation, and Characterizationcited by 64
  5. 2022Structural Entropy Guided Graph Hierarchical Poolingcited by 62
  6. 2019Scalable and Generalizable Social Bot Detection through Data Selectioncited by 59
  7. 2020A Decade of Social Bot Detectioncited by 48
  8. 2023SE-GSL: A General and Effective Graph Structure Learning Framework through Structural Entropy Optimizationcited by 35
  9. 2013The Anatomy of a Scientific Rumorcited by 22
  10. 2019Influence maximization in unknown social networks: Learning Policies for Effective Graph Samplingcited by 20
  11. 2016The DARPA Twitter Bot Challengecited by 15
  12. 2023Hierarchical State Abstraction Based on Structural Information Principlescited by 14
9 more
  1. 2023FedACK: Federated Adversarial Contrastive Knowledge Distillation for Cross-Lingual and Cross-Model Social Bot Detectioncited by 12
  2. 2023Effective and Stable Role-Based Multi-Agent Collaboration by Structural Information Principlescited by 12
  3. 2019Perils and Challenges of Social Media and Election Manipulation Analysis: The 2018 US Midtermscited by 9
  4. 2019Better Safe Than Sorry: An Adversarial Approach to Improve Social Bot Detectioncited by 8
  5. 2021CLAIM: Curriculum Learning Policy for Influence Maximization in Unknown Social Networkscited by 7
  6. 2023Unsupervised Skin Lesion Segmentation via Structural Entropy Minimization on Multi-Scale Superpixel Graphscited by 7
  7. 2018Its All in a Name: Detecting and Labeling Bots by Their Namecited by 6
  8. 2021An Information-theoretic Perspective of Hierarchical Clusteringcited by 6
  9. 2017Two Evidential Data Based Models for Influence Maximization in Twittercited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 4; 2026: 1.

10 papers.