mlsanityData to 7 Oct 2026

Muti-scale Graph Neural Network with Signed-attention for Social Bot Detection: A Frequency Perspective

arXiv 2307.01968 ↗First posted 5 Jul 2023cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

The presence of a large number of bots on social media has adverse effects. The graph neural network (GNN) can effectively leverage the social relationships between users and achieve excellent results in detecting bots. Recently, more and more GNN-based methods have been proposed for bot detection. However, the existing GNN-based bot detection methods only focus on low-frequency information and seldom consider high-frequency information, which limits the representation ability of the model. To address this issue, this paper proposes a Multi-scale with Signed-attention Graph Filter for social bot detection called MSGS. MSGS could effectively utilize both high and low-frequency information in the social graph. Specifically, MSGS utilizes a multi-scale structure to produce representation vectors at different scales. These representations are then combined using a signed-attention mechanism. Finally, multi-scale representations via MLP after polymerization to produce the final result. We analyze the frequency response and demonstrate that MSGS is a more flexible and expressive adaptive graph filter. MSGS can effectively utilize high-frequency information to alleviate the over-smoothing problem of deep GNNs. Experimental results on real-world datasets demonstrate that our method achieves better performance compared with several state-of-the-art social bot detection methods.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 26 of its 37 references that are in the map. First posted on arXiv 5 Jul 2023.

Builds on

26 of 37 references.

References · 26

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  4. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  5. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  6. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  7. 2019Simplifying Graph Convolutional Networkscited by 1,470
  8. 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
  9. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
  10. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
  11. 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
  12. 2014The Rise of Social Botscited by 96
14 more
  1. 2021Local Augmentation for Graph Neural Networkscited by 52
  2. 2021TwiBot-20: A Comprehensive Twitter Bot Detection Benchmarkcited by 51
  3. 2017The paradigm-shift of social spambots: Evidence, theories, and tools for the arms racecited by 49
  4. 2021AdaGNN: Graph Neural Networks with Adaptive Frequency Response Filtercited by 43
  5. 2016BotOrNot: A System to Evaluate Social Botscited by 41
  6. 2021BotRGCN: Twitter Bot Detection with Relational Graph Convolutional Networkscited by 39
  7. 2015Fame for sale: efficient detection of fake Twitter followerscited by 33
  8. 2023MGTAB: A Multi-Relational Graph-Based Twitter Account Detection Benchmarkcited by 16
  9. 2023BotTriNet: A Unified and Efficient Embedding for Social Bots Detection via Metric Learningcited by 13
  10. 2021Boosting-GNN: Boosting Algorithm for Graph Networks on Imbalanced Node Classificationcited by 10
  11. 2023Over-Sampling Strategy in Feature Space for Graphs based Class-imbalanced Bot Detectioncited by 7
  12. 2023HOFA: Twitter Bot Detection with Homophily-Oriented Augmentation and Frequency Adaptive Attentioncited by 7
  13. 2023RF-GNN: Random Forest Boosted Graph Neural Network for Social Bot Detectioncited by 5
  14. 2021Multi-scale Graph Convolutional Networks with Self-Attentioncited by 3

Built on by

Cited by year

Citing papers per year: 2023: 2.

2 papers.