The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Jointly Embedding the Local and Global Relations of Heterogeneous Graph for Rumor Detection
Open accessAbstract
The development of social media has revolutionized the way people communicate, share information and make decisions, but it also provides an ideal platform for publishing and spreading rumors. Existing rumor detection methods focus on finding clues from text content, user profiles, and propagation patterns. However, the local semantic relation and global structural information in the message propagation graph have not been well utilized by previous works. In this paper, we present a novel global-local attention network (GLAN) for rumor detection, which jointly encodes the local semantic and global structural information. We first generate a better integrated representation for each source tweet by fusing the semantic information of related retweets with the attention mechanism. Then, we model the global relationships among all source tweets, retweets, and users as a heterogeneous graph to capture the rich structural information for rumor detection. We conduct experiments on three real-world datasets, and the results demonstrate that GLAN significantly outperforms the state-of-the-art models in both rumor detection and early detection scenarios.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533 · cited 1×
“All word embeddings in the model are initialized with the 300-dimensional word vectors, which are trained on domainspecific review corpora by Skip-gram [31] algorithm.”
MethodVeličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., & Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1710.10903 · Cited by 12,107
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416 · cited 1×
“One major limitation of these approaches is that they ignore the global structural information among different microblogs and users, which however has been shown conducive to provide useful clues for node classification [10].”
BackgroundFast and Accurate Deep Network Learning by Exponential Linear Units (ELUs)
Clevert, D.-A., Unterthiner, T., & Hochreiter, S. (2015) · arXiv · doi:10.48550/arxiv.1511.07289 · Cited by 4,513 · cited 2×
“Specifically, K independent attention mechanisms execute the transformation of Equation (11), and then their features are concatenated, resulting in the following output feature representation: mglobalj = K || k=1 σ ⎛ ⎝ ∑ i∈N (mj) αkjiW k uu ′ i ⎞ ⎠ , uglobali = K || k=1 σ ⎛ ⎝ ∑ j∈N (ui) βkjtW k mm ′ j ⎞ ⎠ , (12) wher…”
A Convolutional Neural Network for Modelling Sentences
Kalchbrenner, N., Grefenstette, E., & Blunsom, P. (2014) · Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.3115/v1/p14-1062 · Cited by 3,601
Empirical Evaluation of Rectified Activations in Convolutional Network
Xu, B., Wang, N., Chen, T., & Li, M. (2015) · arXiv · doi:10.48550/arxiv.1505.00853 · Cited by 2,264 · cited 3×
“The parameter of LeakyReLU [27] non-linearity is set to 0.2.”
BackgroundInfluentialProminent Features of Rumor Propagation in Online Social Media
Kwon, S., Cha, M., Jung, K., Chen, W., & Wang, Y. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.61 · Cited by 859 · cited 1×
“[12] explored a novel approach to identify rumors based on temporal, structural, and linguistic properties of rumor propagation.”
BackgroundAutomatic detection of rumor on Sina Weibo
Yang, F., Liu, Y., Yu, X., & Yang, M. (2012) · Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics · doi:10.1145/2350190.2350203 · Cited by 680 · cited 4×
“• SVM-RBF [4]: An SVM model with RBF kernel that”
BackgroundMethodInfluentialLiu, Y., & Wu, Y.-F. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11268 · Cited by 663 · cited 12×
“For deep learning methods, GRU and PPC outperform traditional classifiers that using manually crafted features.”
BackgroundMethodResultInfluentialEnquiring Minds: Early Detection of Rumors in Social Media from Enquiry Posts
Zhao, Z., Resnick, P., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741637 · Cited by 583 · cited 4×
“It is observed that the performance of the methods based on hand-crafted features (DTR, DTC, RFC, SVM-RBF, and SVM-TS) is obviously poor, indicating that they fail to generalize due to the lack of capacity capturing helpful features.”
BackgroundMethodInfluentialRumor Detection over Varying Time Windows
Kwon, S., Cha, M., & Jung, K. (2017) · PLOS ONE · doi:10.1371/journal.pone.0168344 · Cited by 352
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
Cited by
A Comprehensive Survey on Graph Anomaly Detection With Deep Learning
Ma, X., Wu, J., Xue, S., Yang, J., Zhou, C., Sheng, Q. Z., Xiong, H., & Akoglu, L. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3118815 · Cited by 835
FANG: Leveraging Social Context for Fake News Detection Using Graph Representation
Nguyen, V.-H., Sugiyama, K., Nakov, P., & Kan, M.-Y. (2020) · Proceedings of the 29th ACM International Conference on Information & Knowledge Management · doi:10.1145/3340531.3412046 · Cited by 270
Metadata
- Authors
- Yuan, C., Ma, Q., Zhou, W., Han, J., & Hu, S.
- Venue
- 2019 IEEE International Conference on Data Mining (ICDM)
- Publisher
- IEEE
- Published
- 2019-11
- Pages
- 796-805
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W3004200020
- Cited by
- 192
- References
- 14
- FWCI
- 55.43
- Type
- conference paper
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.