Detecting Emerging Rumors by Embedding Propagation Graphs

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a propagation-driven approach to discover newly emerging rumors which are spreading on social media. Firstly, posts and their responsive ones (i.e., comments, sharing) are modeled as graphs. These graphs will be embedded using their structure and node’s attributes. We then train a classifier to predict from these graph embedding vectors rumor labels. In addition, we also propose an incremental training method to learn embedding vectors of out-of-vocabulary (OOV) words because newly emerging rumor regularly contains new terminologies. To demonstrate the actual performance, we conduct an experiment by using a real-world dataset which is collected from Twitter. The result shows that our approach outperforms the state-of-the-art method with a large margin.

Cite

CITATION STYLE

APA

Vu, D. T., & Jung, J. J. (2020). Detecting Emerging Rumors by Embedding Propagation Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12004 LNCS, pp. 173–184). Springer. https://doi.org/10.1007/978-3-030-42835-8_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free