Skip to content

SeBot: Structural Entropy Guided Multi-View Contrastive learning for Social Bot Detection. KDD 2024

License

Notifications You must be signed in to change notification settings

846468230/SEBot

Repository files navigation

SEBot

The code for paper "SEBot: Structural Entropy Guided Multi-View Contrastive Learning for Social Bot Detection." on SIGKDD Conference on Knowledge Discovery and Data Mining 2024 (KDD).

Abstract

Recent advancements in social bot detection have been driven by the adoption of Graph Neural Networks. The social graph, constructed from social network interactions, contains benign and bot accounts that influence each other. However, previous graph-based detection methods that follow the transductive message-passing paradigm may not fully utilize hidden graph information and are vulnerable to adversarial bot behavior. The indiscriminate message passing between nodes from different categories and communities results in excessively homogeneous node representations, ultimately reducing the effectiveness of social bot detectors. In this paper, we propose SEBot, a novel multi-view graph-based contrastive learning-enabled social bot detector. In particular, we use structural entropy as an uncertainty metric to optimize the entire graph's structure and subgraph-level granularity, revealing the implicitly existing hierarchical community structure. And we design an encoder to enable message passing beyond the homophily assumption, enhancing robustness to adversarial behaviors of social bots. Finally, we employ multi-view contrastive learning to maximize mutual information between different views and enhance the detection performance through multi-task learning. Experimental results demonstrate that our approach significantly improves the performance of social bot detection compared with SOTA methods.

Model

Model Structure

Overview of our proposed framework SeBot, which mainly consists of three modules: 1) Node-level encoding tree generation and bottom-up message passing; 2) Subgraph-level encoding trees generation and message-passing; 3) Relational information aggregation beyond homophily. Contrastive learning loss and classification loss are later calculated on obtained tree types of representations.

Results

Main Results

Performance comparison on TwiBot-20 and MGTAB in terms of accuracy, F1-score, recall and precision. The best and second-best results are highlighted with bold and underline.’-’ indicates that the method is not applicable to MGTAB due to lack of unprocessed raw dataset.

Hyperparameter

Main Results

Sensitive analysis of hyperparameter 𝜆1 and 𝜆2 on TwiBot-20.

Visualization

Main Results

Account representations visualization on TwiBot-20. Red represents bots, while blue represents humans.

Citation

Coming soon

About

SeBot: Structural Entropy Guided Multi-View Contrastive learning for Social Bot Detection. KDD 2024

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages