The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks
Open accessAbstract
Social media has been developing rapidly in public due to its nature of spreading new information, which leads to rumors being circulated. Meanwhile, detecting rumors from such massive information in social media is becoming an arduous challenge. Therefore, some deep learning methods are applied to discover rumors through the way they spread, such as Recursive Neural Network (RvNN) and so on. However, these deep learning methods only take into account the patterns of deep propagation but ignore the structures of wide dispersion in rumor detection. Actually, propagation and dispersion are two crucial characteristics of rumors. In this paper, we propose a novel bi-directional graph model, named Bi-Directional Graph Convolutional Networks (Bi-GCN), to explore both characteristics by operating on both top-down and bottom-up propagation of rumors. It leverages a GCN with a top-down directed graph of rumor spreading to learn the patterns of rumor propagation; and a GCN with an opposite directed graph of rumor diffusion to capture the structures of rumor dispersion. Moreover, the information from source post is involved in each layer of GCN to enhance the influences from the roots of rumors. Encouraging empirical results on several benchmarks confirm the superiority of the proposed method over the state-of-the-art approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Bi-GCN can detect asymmetric information flows indicative of command-and-control behavior, backdoors, or malicious redirection when adapted for network traffic graphs.
“When adapted for network traffic graphs, Bi-GCN can detect asymmetric information flows indicative of command-and-control behavior, backdoors, or malicious redirection.”
From A Survey of Heterogeneous Graph Neural Networks for Cybersecurity Anomaly Detection (2025) · cites this paper as [56]
The Introduction (p. 2) says Bi-GCN models information moving top-down and bottom-up through rumor trees. It does not test adaptation to network traffic graphs or report detection of asymmetric flows, command-and-control behavior, backdoors, or malicious redirection. (LLM, conf=0.86)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Liu, Y., & Wu, Y.-F. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11268 · Cited by 663
Chen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Flagged first, then by citations
Research works printed but not linked: 24
- [Battaglia et al. 2016] Battaglia, P.; Pascanu, R.; Lai, M.; Rezende, D. J.; et al. 2016. Interaction networks for learning about objects, relations and physics. In Advances in neural information processing systems , 4502-4510.
- [Bruna et al. 2014] Bruna, J.; Zaremba, W.; Szlam, A.; and Lecun, Y. 2014. Spectral networks and locally connected networks on graphs. In International Conference on Learning Representations (ICLR2014), CBLS, April 2014 , http-openreview.
- [Castillo, Mendoza, and Poblete 2011] Castillo, C.; Mendoza, M.; and Poblete, B. 2011. Information credibility on twitter. In Proceedings of the 20th international conference on World wide web , 675-684. ACM.
- [Chen et al. 2018] Chen, T.; Li, X.; Yin, H.; and Zhang, J. 2018. Call attention to rumors: Deep attention based recurrent neural networks for early rumor detection. In Pacific-Asia Conference on Knowledge Discovery and Data Mining , 40-52. Springer.
- [Defferrard, Bresson, and Vandergheynst 2016] Defferrard, M.; Bresson, X.; and Vandergheynst, P. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In Advances in neural information processing systems , 3844-3852.
- [Giudice 2010] Giudice, K. D. 2010. Crowdsourcing credibility: The impact of audience feedback on web page credibility. In Proceedings of the 73rd ASIS&T Annual Meeting on Navigating Streams in an Information Ecosystem-Volume 47 , 59. American Society for Information Science.
- [Hamilton, Ying, and Leskovec 2017] Hamilton, W.; Ying, Z.; and Leskovec, J. 2017. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems , 1024-1034.
- [Kipf and Welling 2017] Kipf, N., T., and Welling, M. 2017. Semisupervised classification with graph convolutional networks. In Proceedings of the International Conference on Learning Representations .
- [Kwon et al. 2013] Kwon, S.; Cha, M.; Jung, K.; Chen, W.; and Wang, Y. 2013. Prominent features of rumor propagation in online social media. In 2013 IEEE 13th International Conference on Data Mining , 1103-1108. IEEE.
- [Liu et al. 2015] Liu, X.; Nourbakhsh, A.; Li, Q.; Fang, R.; and Shah, S. 2015. Real-time rumor debunking on twitter. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management , 1867-1870. ACM.
- [Ma et al. 2015] Ma, J.; Gao, W.; Wei, Z.; Lu, Y.; and Wong, K.-F. 2015. Detect rumors using time series of social context information on microblogging websites. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management , 1751-1754. ACM.
- [Ma, Gao, and Wong 2017] Ma, J.; Gao, W.; and Wong, K.-F. 2017. Detect rumors in microblog posts using propagation structure via kernel learning. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , 708-717.
- [Ma, Gao, and Wong 2018] Ma, J.; Gao, W.; and Wong, K.-F. 2018. Rumor detection on twitter with tree-structured recursive neural networks. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , 1980-1989.
- [Ma, Gao, and Wong 2019] Ma, J.; Gao, W.; and Wong, K.-F. 2019. Detect rumors on twitter by promoting information campaigns with generative adversarial learning. In The World Wide Web Conference , 3049-3055. ACM.
- [Rong et al. 2019] Rong, Y.; Huang, W.; Xu, T.; and Junzhou, H. 2019. The truly deep graph convolutional networks for node classification. arXiv preprint arXiv:1907.10903 . · arXiv
- [Scarselli et al. 2008] Scarselli, F.; Gori, M.; Tsoi, A. C.; Hagenbuchner, M.; and Monfardini, G. 2008. The graph neural network model. IEEE Transactions on Neural Networks 20(1):61-80.
- [Srivastava et al. 2014] Srivastava, N.; Hinton, G.; Krizhevsky, A.; Sutskever, I.; and Salakhutdinov, R. 2014. Dropout: a simple way to prevent neural networks from overfitting. The journal of machine learning research 15(1):1929-1958.
- [Thomas 2007] Thomas, S. A. 2007. Lies, damn lies, and rumors: an analysis of collective efficacy, rumors, and fear in the wake of katrina. Sociological Spectrum 27(6):679-703.
- [Wu, Yang, and Zhu 2015] Wu, K.; Yang, S.; and Zhu, K. Q. 2015. False rumors detection on sina weibo by propagation structures. In 2015 IEEE 31st international conference on data engineering , 651-662. IEEE.
- [Yang et al. 2012] Yang, F.; Liu, Y.; Yu, X.; and Yang, M. 2012. Automatic detection of rumor on sina weibo. In Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics , 13. ACM.
- [Yao, Rosasco, and Caponnetto 2007] Yao, Y.; Rosasco, L.; and Caponnetto, A. 2007. On early stopping in gradient descent learning. Constructive Approximation 26(2):289-315.
- [Yu et al. 2017] Yu, F.; Liu, Q.; Wu, S.; Wang, L.; and Tan, T. 2017. A convolutional approach for misinformation identification. In Proceedings of the 26th International Joint Conference on Artificial Intelligence , 3901-3907. AAAI Press.
- [Zhao, Resnick, and Mei 2015] Zhao, Z.; Resnick, P.; and Mei, Q. 2015. Enquiring minds: Early detection of rumors in social media from enquiry posts. In Proceedings of the 24th International Conference on World Wide Web , 1395-1405. International World Wide Web Conferences Steering Committee.
- [Zubiaga et al. 2018] Zubiaga, A.; Aker, A.; Bontcheva, K.; Liakata, M.; and Procter, R. 2018. Detection and resolution of rumours in social media: A survey. ACMComputing Surveys (CSUR) 51(2):32.
Cited by
Sorted by citations
SoK: Content Moderation in Social Media, from Guidelines to Enforcement, and Research to Practice
Singhal, M., Ling, C., Paudel, P., Thota, P., Kumarswamy, N., Stringhini, G., & Nilizadeh, S. (2023) · 2023 IEEE 8th European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp57164.2023.00056 · Cited by 57
A Survey of Heterogeneous Graph Neural Networks for Cybersecurity Anomaly Detection
Jiang, L., Ryan, R., Li, Q., & Ferdosian, N. (2025) · arXiv · doi:10.48550/arxiv.2510.26307 · Cited by 13
“Bi-GCN [56], although originally proposed for rumor detection, employs bidirectional message passing to model influence propagation across graph edges.”
Influential
Metadata
- Authors
- Bian, T., Xiao, X., Xu, T., Zhao, P., Huang, W., Rong, Y., & Huang, J.
- Affiliations
- Tsinghua University (CN)
- Tencent (China) (CN)
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2020-04-03
- Volume
- 34
- Issue
- 01
- Pages
- 549-556
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2997128522
- Cited by
- 796
- References
- 3
- Citations by year
- 2026: 97 · 2025: 155 · 2024: 170 · 2023: 157 · 2022: 128 · 2021: 76 · 2020: 13
- FWCI
- 198.29
- Type
- conference paper
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- www.aaai.org/ (unspecified)
- Locations
- Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Tencent
- National Natural Science Foundation of China (61972219, 61773229)
- Natural Science Foundation of Guangdong Province (2018A030313422)
- Tsinghua University (HW2018002)
- Topics
- Social Sciences › Sociology and Political Science › Misinformation and Its Impacts
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Information Systems › Spam and Phishing Detection
- Keywords
- rumor detection, social media, graph convolutional networks, rumor propagation, directed graphs
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review