Community-Enhanced Dynamic Graph Convolutional Networks for Rumor Detection on Social Networks

Along with the increasing popularization of social platforms, rumors in the Web environment have become one of the significant threats to human society. Existing rumor detection methods ignore modeling and analyzing the community structure of the rumor propagation network. This article proposes a new community-enhanced dynamic graph convolutional network (CDGCN) for effective rumor detection on online social networks, which utilize the communities formed in a rumor propagation process to improve rumor detection accuracy. CDGCN uses a designed method that combines node features and topology features to identify the communities and learn the community features of rumors. Following this, a graph convolutional network (GCN) with a community-aware attention mechanism is proposed to enable the nodes to dynamically aggregate information from their neighboring nodes’ global and community features, effectively prioritizing critical neighborhood information, enhancing the representation of both local community structures and global network patterns for improved analytical performance. The final rumor representations generated by the GCN are processed by a classifier to detect false rumors. Comprehensive experiments and comparison studies are conducted on four real-world datasets to validate the effectiveness of CDGCN.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Computational Social Systems
Published
2024-12-11
DOI
https://doi.org/10.1109/tcss.2024.3505892
Citations
5
Primary Topic
Misinformation and Its Impacts
Type
article
Field-Weighted Citation Impact
5.66
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Community-Enhanced Dynamic Graph Convolutional Networks for Rumor Detection on Social Networks

Min Gao, Junhao Wen, Fengji Luo, C. Wang et al.
5 citations
IEEE Transactions on Computational Social Systems
Misinformation and Its Impacts
5.66
article

Community-Enhanced Dynamic Graph Convolutional Networks for Rumor Detection on Social Networks

Min Gao, Junhao Wen, Fengji Luo, C. Wang, Yu Wang, Wei Zhou
article en
5 citations

Abstract

Along with the increasing popularization of social platforms, rumors in the Web environment have become one of the significant threats to human society. Existing rumor detection methods ignore modeling and analyzing the community structure of the rumor propagation network. This article proposes a new community-enhanced dynamic graph convolutional network (CDGCN) for effective rumor detection on online social networks, which utilize the communities formed in a rumor propagation process to improve rumor detection accuracy. CDGCN uses a designed method that combines node features and topology features to identify the communities and learn the community features of rumors. Following this, a graph convolutional network (GCN) with a community-aware attention mechanism is proposed to enable the nodes to dynamically aggregate information from their neighboring nodes’ global and community features, effectively prioritizing critical neighborhood information, enhancing the representation of both local community structures and global network patterns for improved analytical performance. The final rumor representations generated by the GCN are processed by a classifier to detect false rumors. Comprehensive experiments and comparison studies are conducted on four real-world datasets to validate the effectiveness of CDGCN.

IEEE Transactions on Computational Social SystemsVol. 12(2)
The University of Sydney (AU), Chongqing University (CN)
Reduced inequalities
Openalex Percentile: Top 4%
Misinformation and Its Impacts
5.66
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.