Rumor detection using dual embeddings and text-based graph convolutional network

Abstract Social media platforms like Twitter and Facebook have gradually become vital for communication and information exchange. However, this often leads to the spread of unreliable or false information, such as harmful rumors. Currently, graph convolutional networks (GCNs), particularly TextGCN, have shown promise in text classification tasks, including rumor detection. Their success is due to their ability to identify structural patterns in rumors and effectively use neighborhood information. We present a novel rumor detection model using TextGCN, which utilizes a word-document graph to represent rumor texts. This model uses dual embedding from two pre-trained transformer models: generative pre-trained transformers (GPT) and bidirectional encoder representations from transformers (BERT). These embeddings serve as node representations within the graph, enhancing rumor detection. Combining these deep neural networks effectively extracts significant contextual features from rumors. This graph undergoes convolution, and through graph-based learning, the model detects a rumor. We evaluated our model using publicly available rumor datasets, such as PHEME, Twitter15, and Twitter16. It achieved 88.64% accuracy on the PHEME dataset, surpassing similar models, and performed well on Twitter15 and Twitter16 with accuracies of 81.98% and 83.41%, respectively.

Authors

Institutions

Publication Details

Journal
Discover Artificial Intelligence
Published
2024-11-19
DOI
https://doi.org/10.1007/s44163-024-00193-6
Citations
7
Primary Topic
Misinformation and Its Impacts
Type
article
Field-Weighted Citation Impact
7.92
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Rumor detection using dual embeddings and text-based graph convolutional network

Sourav Mandal, Rudra M. Tripathy, Arif Ahmed Sekh, Barsha Pattanaik
7 citations
Discover Artificial Intelligence
Misinformation and Its Impacts
7.92
article

Rumor detection using dual embeddings and text-based graph convolutional network

Sourav Mandal, Rudra M. Tripathy, Arif Ahmed Sekh, Barsha Pattanaik
article en
7 citations

Abstract

Abstract Social media platforms like Twitter and Facebook have gradually become vital for communication and information exchange. However, this often leads to the spread of unreliable or false information, such as harmful rumors. Currently, graph convolutional networks (GCNs), particularly TextGCN, have shown promise in text classification tasks, including rumor detection. Their success is due to their ability to identify structural patterns in rumors and effectively use neighborhood information. We present a novel rumor detection model using TextGCN, which utilizes a word-document graph to represent rumor texts. This model uses dual embedding from two pre-trained transformer models: generative pre-trained transformers (GPT) and bidirectional encoder representations from transformers (BERT). These embeddings serve as node representations within the graph, enhancing rumor detection. Combining these deep neural networks effectively extracts significant contextual features from rumors. This graph undergoes convolution, and through graph-based learning, the model detects a rumor. We evaluated our model using publicly available rumor datasets, such as PHEME, Twitter15, and Twitter16. It achieved 88.64% accuracy on the PHEME dataset, surpassing similar models, and performed well on Twitter15 and Twitter16 with accuracies of 81.98% and 83.41%, respectively.

Discover Artificial IntelligenceVol. 4(1)
UiT The Arctic University of Norway (NO)
Openalex Percentile: Top 3%
Misinformation and Its Impacts
7.92
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.