Graph Representation Learning with Massive Unlabeled Data for Rumor Detection
Chaoqun Cui, Caiyan Jia

TL;DR
This paper leverages large-scale unlabeled social media data and self-supervised graph learning methods to improve rumor detection, especially in few-shot scenarios, addressing data scarcity and generalization issues.
Contribution
It introduces the use of massive unlabeled social media datasets with self-supervised graph learning to enhance rumor detection performance and generalization.
Findings
Self-supervised methods outperform previous rumor detection models.
Models achieve strong results with limited labeled data.
Unlabeled data improves detection across diverse topics.
Abstract
With the development of social media, rumors spread quickly, cause great harm to society and economy. Thereby, many effective rumor detection methods have been developed, among which the rumor propagation structure learning based methods are particularly effective compared to other methods. However, the existing methods still suffer from many issues including the difficulty to obtain large-scale labeled rumor datasets, which leads to the low generalization ability and the performance degeneration on new events since rumors are time-critical and usually appear with hot topics or newly emergent events. In order to solve the above problems, in this study, we used large-scale unlabeled topic datasets crawled from the social media platform Weibo and Twitter with claim propagation structure to improve the semantic learning ability of a graph reprentation learing model on various topics. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
