Papers
Topics
Authors
Recent
Search
2000 character limit reached

Adversarial Socialbots Modeling Based on Structural Information Principles

Published 13 Dec 2023 in cs.SI and cs.AI | (2312.08098v1)

Abstract: 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. Protecting elections from social media manipulation. Science, 365(6456): 858–861.
  2. Deep learning based social bot detection on twitter. IEEE Transactions on Information Forensics and Security, 18: 1763–1772.
  3. Bellman, R. 1957. A Markovian decision process. Journal of mathematics and mechanics, 679–684.
  4. Its all in a name: detecting and labeling bots by their name. Computational and mathematical organization theory, 25: 24–35.
  5. Debot: Twitter bot detection via warped correlation. In ICDM, volume 18, 28–65.
  6. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, 199–208.
  7. Cresci, S. 2020. A decade of social bot detection. Communications of the ACM, 63(10): 72–83.
  8. Better safe than sorry: an adversarial approach to improve social bot detection. In Proceedings of the 10th ACM Conference on Web Science, 47–56.
  9. The coming age of adversarial social bot detection. First Monday.
  10. Manipulation among the arbiters of collective intelligence: How Wikipedia administrators mold public opinion. ACM Transactions on the Web (TWEB), 10(4): 1–25.
  11. The anatomy of a scientific rumor. Scientific reports, 3(1): 1–9.
  12. Perils and challenges of social media and election manipulation analysis: The 2018 us midterms. In Companion proceedings of the 2019 world wide web conference, 237–247.
  13. The rise of social bots. Communications of the ACM, 59(7): 96–104.
  14. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing letters, 12: 211–223.
  15. Two evidential data based models for influence maximization in twitter. Knowledge-Based Systems, 121: 58–70.
  16. Influence Maximization in Unknown Social Networks: Learning Policies for Effective Graph Sampling. In Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, 575–583.
  17. Socialbots on Fire: Modeling Adversarial Behaviors of Socialbots via Multi-Agent Hierarchical Reinforcement Learning. In Proceedings of the ACM Web Conference 2022, 545–554.
  18. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, 420–429.
  19. Structural information and dynamical complexity of networks. IEEE Transactions on Information Theory, 62(6): 3290–3339.
  20. Three-dimensional gene map of cancer cell types: Structural entropy minimisation principle for defining tumour subtypes. Scientific Reports, 6: 1–26.
  21. Decoding topologically associating domains with ultra-low resolution Hi-C data by graph structural entropy. Nature communications, 9(1): 3265.
  22. CLAIM: Curriculum learning policy for influence maximization in unknown social networks. In Uncertainty in Artificial Intelligence, 1455–1465. PMLR.
  23. A survey on information diffusion in online social networks: Models and methods. Information, 8(4): 118.
  24. REM: From structural entropy to community structure deception. Advances in Neural Information Processing Systems, 32.
  25. An Information-theoretic Perspective of Hierarchical Clustering. arXiv preprint arXiv:2108.06036.
  26. Correcting for missing data in information cascades. In Proceedings of the fourth ACM international conference on Web search and data mining, 55–64.
  27. Modeling relational data with graph convolutional networks. In The Semantic Web: 15th International Conference, ESWC 2018, Heraklion, Crete, Greece, June 3–7, 2018, Proceedings 15, 593–607. Springer.
  28. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347.
  29. Shannon, C. E. 1948. A mathematical theory of communication. The Bell system technical journal, 27(3): 379–423.
  30. The DARPA Twitter bot challenge. Computer, 49(6): 38–46.
  31. Online human-bot interactions: Detection, estimation, and characterization. In Proceedings of the international AAAI conference on web and social media, 280–289.
  32. Structural entropy guided graph hierarchical pooling. In ICML, 24017–24030. PMLR.
  33. Scalable and generalizable social bot detection through data selection. In Proceedings of the AAAI conference on artificial intelligence, 1096–1103.
  34. FedACK: Federated Adversarial Contrastive Knowledge Distillation for Cross-Lingual and Cross-Model Social Bot Detection. In Proceedings of the ACM Web Conference 2023, 1314–1323.
  35. Minimum entropy principle guided graph neural networks. In Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 114–122.
  36. Unsupervised Skin Lesion Segmentation via Structural Entropy Minimization on Multi-Scale Superpixel Graphs. In IEEE ICDM.
  37. Effective and Stable Role-Based Multi-Agent Collaboration by Structural Information Principles. Proceedings of the AAAI Conference on Artificial Intelligence, 37(10): 11772–11780.
  38. Hierarchical State Abstraction Based on Structural Information Principles. In IJCAI.
  39. SE-GSL: A General and Effective Graph Structure Learning Framework through Structural Entropy Optimization. In Proceedings of the ACM Web Conference 2023, 499–510.
Citations (9)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.