BotTrans: A Multi-Source Graph Domain Adaptation Approach for Social Bot Detection
Transferring extensive knowledge from relevant social networks has emerged as a promising solution to overcome label scarcity in detecting social bots and other anomalies with GNN-based models. However, effective transfer faces two critical challenges. Firstly, the network heterophily problem, which is caused by bots hiding malicious behaviors via indiscriminately interacting with human users, hinders the model's ability to learn sufficient and accurate bot-related knowledge from source domains. Secondly, single-source transfer might lead to inferior and unstable results, as the source network may embody weak relevance to the task and provide limited knowledge. To address these challenges, we explore multiple source domains and propose a multi-source graph domain adaptation model named \textit{BotTrans}. We initially leverage the labeling knowledge shared across multiple source networks to establish a cross-source-domain topology with increased network homophily. We then aggregate cross-domain neighbor information to enhance the discriminability of source node embeddings. Subsequently, we integrate the relevance between each source-target pair with model optimization, which facilitates knowledge transfer from source networks that are more relevant to the detection task. Additionally, we propose a refinement strategy to improve detection performance by utilizing semantic knowledge within the target domain. Extensive experiments on real-world datasets demonstrate that \textit{BotTrans} outperforms the existing state-of-the-art methods, revealing its efficacy in leveraging multi-source knowledge when the target detection task is unlabeled.
Code (1)
Tasks
Domain AdaptationGRAPH DOMAIN ADAPTATIONModel OptimizationTransfer LearningSimilar Papers 제목 키워드 기반
Aggregate to Adapt: Node-Centric Aggregation for Multi-Source-Free Graph Domain Adaptation
Unsupervised graph domain adaptation (UGDA) focuses on transferring knowledge from labeled source graph to unlabeled target graph under domain discrepancies. Most existing UGDA methods are designed to adapt information f…
Domain AdaptationGRAPH DOMAIN ADAPTATIONMulti-source Unsupervised Domain Adaptation on Graphs with Transferability Modeling
In this paper, we tackle a new problem of \textit{multi-source unsupervised domain adaptation (MSUDA) for graphs}, where models trained on annotated source domains need to be transferred to the unsupervised target graph …
Domain AdaptationMeta-LearningMulti-Source Unsupervised Domain AdaptationNode Classification+1Collaborate to Adapt: Source-Free Graph Domain Adaptation via Bi-directional Adaptation
Unsupervised Graph Domain Adaptation (UGDA) has emerged as a practical solution to transfer knowledge from a label-rich source graph to a completely unlabelled target graph. However, most methods require a labelled sourc…
Contrastive LearningDomain AdaptationGRAPH DOMAIN ADAPTATIONRethinking Propagation for Unsupervised Graph Domain Adaptation
Unsupervised Graph Domain Adaptation (UGDA) aims to transfer knowledge from a labelled source graph to an unlabelled target graph in order to address the distribution shifts between graph domains. Previous works have pri…
Domain AdaptationGRAPH DOMAIN ADAPTATIONOpen-Set Multi-Source Multi-Target Domain Adaptation
Single-Source Single-Target Domain Adaptation (1S1T) aims to bridge the gap between a labelled source domain and an unlabelled target domain. Despite 1S1T being a well-researched topic, they are typically not deployed to…
Domain AdaptationGraph AttentionMulti-target Domain Adaptation