TY - GEN
T1 - BotSCL
T2 - 27th International Conference on Pattern Recognition, ICPR 2024
AU - Wu, Qi
AU - Yang, Yingguang
AU - He, Buyun
AU - Liu, Hao
AU - Yang, Renyu
AU - Liao, Yong
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
PY - 2025
Y1 - 2025
N2 - Detecting social bots, which continuously evolve, presents an escalating challenge. Although graph-based detection techniques utilize various relationships within social networks to model node behavior, they often fail to account for inherent heterophily–connections between different types of accounts. When message passing occurs across heterophilous edges, it can cause feature blending between bots and legitimate users, leading to indistinct representations. To address this issue, we propose BotSCL, a contrastive learning framework that is aware of heterophily. BotSCL adapts by differentiating between representations of heterophilous neighbors while aligning representations of homophilous ones. Our approach employs two graph augmentation strategies to create varied graph views and introduces a channel-wise, attention-free encoder to address the limitations of traditional neighbor information aggregation. Supervised contrastive learning then helps the encoder focus on aggregating information specific to each class. Extensive experiments on two real-world social bot detection datasets reveal that BotSCL outperforms existing baseline models, including advanced bot detection methods, as well as techniques based on partial heterophily and graph contrastive learning.
AB - Detecting social bots, which continuously evolve, presents an escalating challenge. Although graph-based detection techniques utilize various relationships within social networks to model node behavior, they often fail to account for inherent heterophily–connections between different types of accounts. When message passing occurs across heterophilous edges, it can cause feature blending between bots and legitimate users, leading to indistinct representations. To address this issue, we propose BotSCL, a contrastive learning framework that is aware of heterophily. BotSCL adapts by differentiating between representations of heterophilous neighbors while aligning representations of homophilous ones. Our approach employs two graph augmentation strategies to create varied graph views and introduces a channel-wise, attention-free encoder to address the limitations of traditional neighbor information aggregation. Supervised contrastive learning then helps the encoder focus on aggregating information specific to each class. Extensive experiments on two real-world social bot detection datasets reveal that BotSCL outperforms existing baseline models, including advanced bot detection methods, as well as techniques based on partial heterophily and graph contrastive learning.
KW - homophily and heterophily
KW - social bot detection
KW - supervised contrastive learning
UR - https://www.scopus.com/pages/publications/85212250229
U2 - 10.1007/978-3-031-78183-4_4
DO - 10.1007/978-3-031-78183-4_4
M3 - 会议稿件
AN - SCOPUS:85212250229
SN - 9783031781827
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 53
EP - 68
BT - Pattern Recognition - 27th International Conference, ICPR 2024, Proceedings
A2 - Antonacopoulos, Apostolos
A2 - Chaudhuri, Subhasis
A2 - Chellappa, Rama
A2 - Liu, Cheng-Lin
A2 - Bhattacharya, Saumik
A2 - Pal, Umapada
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 1 December 2024 through 5 December 2024
ER -