Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

BotSCL: Heterophily-aware Social Bot Detection with Supervised Contrastive Learning (2306.07478v3)

Published 13 Jun 2023 in cs.SI

Abstract: Detecting ever-evolving social bots has become increasingly challenging. Advanced bots tend to interact more with humans as a camouflage to evade detection. While graph-based detection methods can exploit various relations in social networks to model node behaviors, the aggregated information from neighbors largely ignore the inherent heterophily, i.e., the connections between different classes of accounts. Message passing mechanism on heterophilic edges can lead to feature mixture between bots and normal users, resulting in more false negatives. In this paper, we present BotSCL, a heterophily-aware contrastive learning framework that can adaptively differentiate neighbor representations of heterophilic relations while assimilating the representations of homophilic neighbors. Specifically, we employ two graph augmentation methods to generate different graph views and design a channel-wise and attention-free encoder to overcome the limitation of neighbor information summing. Supervised contrastive learning is used to guide the encoder to aggregate class-specific information. Extensive experiments on two social bot detection benchmarks demonstrate that BotSCL outperforms baseline approaches including the state-of-the-art bot detection approaches, partially heterophilic GNNs and self-supervised contrast learning methods.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (50)
  1. Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing. In ICML. PMLR, 21–29.
  2. Detect me if you can: Spam bot detection using inductive representation learning. In WWW. 148–153.
  3. David M Beskow and Kathleen M Carley. 2019. Its all in a name: detecting and labeling bots by their name. Computational and mathematical organization theory 25, 1 (2019), 24–35.
  4. Graph Barlow Twins: A self-supervised representation learning framework for graphs. Knowledge-Based Systems 256 (2022), 109631.
  5. Beyond low-frequency information in graph convolutional networks. In AAAI. 3950–3957.
  6. Temporal patterns in bot activities. In WWW. 1601–1606.
  7. Towards Self-supervised Learning on Graphs with Heterophily. In CIKM. 201–211.
  8. Adaptive universal generalized pagerank graph neural network. arXiv preprint arXiv:2006.07988 (2020).
  9. Stefano Cresci. 2020. A decade of social bot detection. Commun. ACM 63, 10 (2020), 72–83.
  10. Perils and challenges of social media and election manipulation analysis: The 2018 us midterms. In WWW. 237–247.
  11. Detecting bots and assessing their impact in social networks. Operations Research 70, 1 (2022), 1–22.
  12. Heterogeneity-aware twitter bot detection with relational graph transformers. In AAAI, Vol. 36. 3977–3985.
  13. TwiBot-22: Towards graph-based Twitter bot detection. arXiv preprint arXiv:2206.04564 (2022).
  14. Satar: A self-supervised approach to twitter account representation learning and its application in bot detection. In CIKM. 3808–3817.
  15. Twibot-20: A comprehensive twitter bot detection benchmark. In CIKM. 4485–4494.
  16. BotRGCN: Twitter bot detection with relational graph convolutional networks. In SNAM. 236–239.
  17. Emilio Ferrara. 2017. Disinformation and social bot operations in the run up to the 2017 French presidential election. arXiv preprint arXiv:1707.00086 (2017).
  18. Matthias Fey and Jan Eric Lenssen. 2019. Fast graph representation learning with PyTorch Geometric. arXiv preprint arXiv:1903.02428 (2019).
  19. Sami Abdullah Hamdi. 2022. Mining ideological discourse on Twitter: The case of extremism in Arabic. Discourse & Communication 16, 1 (2022), 76–92.
  20. Supervised contrastive learning. Advances in neural information processing systems 33 (2020), 18661–18673.
  21. Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016).
  22. Sneha Kudugunta and Emilio Ferrara. 2018. Deep neural networks for bot detection. Information Sciences 467 (2018), 312–322.
  23. Socialbots on Fire: Modeling Adversarial Behaviors of Socialbots via Multi-Agent Hierarchical Reinforcement Learning. In ACM Web Conference 2022. 545–554.
  24. Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating. arXiv preprint arXiv:2211.14065 (2022).
  25. Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification? arXiv preprint arXiv:2109.05641 (2021).
  26. Samaneh Hosseini Moghaddam and Maghsoud Abbaspour. 2022. Friendship Preference: Scalable and Robust Category of Features for Social Bot Detection. IEEE Transactions on Dependable and Secure Computing (2022).
  27. Pytorch: An imperative style, high-performance deep learning library. Advances in neural information processing systems 32 (2019).
  28. Geom-gcn: Geometric graph convolutional networks. arXiv preprint arXiv:2002.05287 (2020).
  29. Modeling relational data with graph convolutional networks. In European semantic web conference. Springer, 593–607.
  30. H2-FDetector: A GNN-based Fraud Detector with Homophilic and Heterophilic Connections. In ACM Web Conference 2022. 1486–1494.
  31. Rethinking Graph Neural Networks for Anomaly Detection. arXiv preprint arXiv:2205.15508 (2022).
  32. Laurens Van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of machine learning research 9, 11 (2008).
  33. Attention is all you need. Advances in neural information processing systems 30 (2017).
  34. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017).
  35. Deep graph infomax. ICLR (Poster) 2, 3 (2019), 4.
  36. Feng Wang and Huaping Liu. 2021. Understanding the behaviour of contrastive loss. In CVPR. 2495–2504.
  37. Powerful graph convolutional networks with adaptive propagation mechanism for homophily and heterophily. In AAAI. 4210–4218.
  38. Homophily and Transitivity in Bot Disinformation Networks. In SNAMS. IEEE, 1–7.
  39. A novel framework for detecting social bots with deep neural networks and active learning. Knowledge-Based Systems 211 (2021), 106525.
  40. Empirical evaluation and new design for fighting evolving twitter spammers. IEEE Transactions on Information Forensics and Security 8, 8 (2013), 1280–1293.
  41. Botometer 101: Social bot practicum for computational social scientists. Journal of Computational Social Science (2022), 1–18.
  42. Scalable and generalizable social bot detection through data selection. In AAAI, Vol. 34. 1096–1103.
  43. Wenhan Yang and Baharan Mirzasoleiman. 2023. Contrastive Learning under Heterophily. arXiv preprint arXiv:2303.06344 (2023).
  44. RoSGAS: Adaptive Social Bot Detection with Reinforced Self-Supervised GNN Architecture Search. ACM Transactions on the Web (2022).
  45. FedACK: Federated Adversarial Contrastive Knowledge Distillation for Cross-Lingual and Cross-Model Social Bot Detection. In ACM Web Conference 2023. 1314–1323.
  46. Graph contrastive learning with augmentations. Advances in neural information processing systems 33 (2020), 5812–5823.
  47. Weakly supervised contrastive learning. In Proceedings of the IEEE/CVF International Conference on Computer Vision. 10042–10051.
  48. Beyond homophily in graph neural networks: Current limitations and effective designs. Advances in Neural Information Processing Systems 33 (2020), 7793–7804.
  49. An empirical study of graph contrastive learning. arXiv preprint arXiv:2109.01116 (2021).
  50. Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131 (2020).
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Qi Wu (323 papers)
  2. Yingguang Yang (9 papers)
  3. Buyun He (5 papers)
  4. Hao Liu (497 papers)
  5. Yong Liao (38 papers)
  6. Renyu Yang (17 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.