arrow
Return

Unsupervised Rumor Detection Based on Propagation Tree VAE

delete2023-10-01
delete12
PRE
AI
方兰婷 cover
方兰婷 (Lanting Fang)
冯恺宇 cover
冯恺宇 (Kaiyu Feng) *
K
Kaiqi Zhao
胡爱群 (Aiqun Hu)
T
Tao Li
DOI:10.1109/TKDE.2023.3267821delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The wide spread of rumors inflicts damages on social media platforms. Detecting rumors has become an emerging problem concerning the public and government. A crucial problem for rumors detection on social media is the lack of reliably pre-annotated dataset to train classification models. To solve this problem, we propose an unsupervised model that detects rumors by measuring how well the tweets follow the normal patterns. However, the problem is challenging in how to automatically discover the normal patterns of tweets. To tackle the challenge, we first propose a novel tree variational autoencoder model that reconstructs the sentiment labels along the propagation tree of a factual tweet. Then we propose a cross-alignment method to align the multiple modalities, i.e., tree structure and propagation features, and output the final prediction results. We conduct extensive experiments on a real-world dataset collected from Weibo. The experiments show that the proposed method significantly outperforms the state-of-the-art unsupervised methods and adapts better to the concept drift than state-of-the-art supervised methods.
Keywords:
Social networking (online)
Blogs
Fake news
Decoding
Writing
Topology
Reliability
Tree VAE
unsupervised rumor detection
propagation structure

Journal

IEEE Transactions on Knowledge and Data Engineering cover
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
Papers:
6.8K
Citations:
3.2W

Organization

B
beijing institute of technology
Scholars:
5.5W
Papers: 4.0W
Citations: 63
U
University of Auckland
Scholars:
2.3W
Papers: 2.4W
Citations: 3.3W
S
southeast university - china
Scholars:
5.3W
Papers: 4.9W
Citations: 57
researcher View more organizations