Nowhere to Hide : Online Rumor Detection Based on Retweeting Graph Neural Networks
Online rumor detection is crucial for a healthier online environment. Traditional methods mainly rely on content understanding. However, these contents can be easily adjusted to avoid such supervision and are insufficient to improve the detection result. Compared with the content, information propagation patterns are more informative to support further performance promotion. Unfortunately, learning the propagation patterns is difficult, since the retweeting tree is more topologically complicated than linear sequences or binary trees. In light of this, we propose a novel rumor detection framework based on structure-aware retweeting graph neural networks. To capture the propagation patterns, we first design a novel conversion method to transform the complex retweeting tree as more tractable binary tree without losing the reconstruction information. Then, we serialize the retweeting tree as a corpus of meta-tree paths, where each meta-tree can preserve a basic substructure. A deep neural network is then designed to integrate all meta-trees and to generate the global structural embeddings. Furthermore, we propose to integrate content, users, and propagation patterns to enhance more reliable performance. To this end, we propose a novel self-attention-based retweeting neural network to learn individual features from both content and users. We then fuse the node-level features with our global structural embeddings via a mutual attention unit. In this way, we can generate more comprehensive representations for rumor detection. Extensive evaluations on two real-world datasets show remarkable superiorities of our model compared with existing methods.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2024 |
|---|---|
| Erschienen: |
2024 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:35 |
|---|---|
| Enthalten in: |
IEEE transactions on neural networks and learning systems - 35(2024), 4 vom: 06. Apr., Seite 4887-4898 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Liu, Bo [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
|---|
| Anmerkungen: |
Date Revised 06.04.2024 published: Print-Electronic Citation Status PubMed-not-MEDLINE |
|---|
| doi: |
10.1109/TNNLS.2022.3161697 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM339151404 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM339151404 | ||
| 003 | DE-627 | ||
| 005 | 20240407232214.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231226s2024 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1109/TNNLS.2022.3161697 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1368.xml |
| 035 | |a (DE-627)NLM339151404 | ||
| 035 | |a (NLM)35385391 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Liu, Bo |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Nowhere to Hide |b Online Rumor Detection Based on Retweeting Graph Neural Networks |
| 264 | 1 | |c 2024 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Revised 06.04.2024 | ||
| 500 | |a published: Print-Electronic | ||
| 500 | |a Citation Status PubMed-not-MEDLINE | ||
| 520 | |a Online rumor detection is crucial for a healthier online environment. Traditional methods mainly rely on content understanding. However, these contents can be easily adjusted to avoid such supervision and are insufficient to improve the detection result. Compared with the content, information propagation patterns are more informative to support further performance promotion. Unfortunately, learning the propagation patterns is difficult, since the retweeting tree is more topologically complicated than linear sequences or binary trees. In light of this, we propose a novel rumor detection framework based on structure-aware retweeting graph neural networks. To capture the propagation patterns, we first design a novel conversion method to transform the complex retweeting tree as more tractable binary tree without losing the reconstruction information. Then, we serialize the retweeting tree as a corpus of meta-tree paths, where each meta-tree can preserve a basic substructure. A deep neural network is then designed to integrate all meta-trees and to generate the global structural embeddings. Furthermore, we propose to integrate content, users, and propagation patterns to enhance more reliable performance. To this end, we propose a novel self-attention-based retweeting neural network to learn individual features from both content and users. We then fuse the node-level features with our global structural embeddings via a mutual attention unit. In this way, we can generate more comprehensive representations for rumor detection. Extensive evaluations on two real-world datasets show remarkable superiorities of our model compared with existing methods | ||
| 650 | 4 | |a Journal Article | |
| 700 | 1 | |a Sun, Xiangguo |e verfasserin |4 aut | |
| 700 | 1 | |a Meng, Qing |e verfasserin |4 aut | |
| 700 | 1 | |a Yang, Xinyan |e verfasserin |4 aut | |
| 700 | 1 | |a Lee, Yang |e verfasserin |4 aut | |
| 700 | 1 | |a Cao, Jiuxin |e verfasserin |4 aut | |
| 700 | 1 | |a Luo, Junzhou |e verfasserin |4 aut | |
| 700 | 1 | |a Lee, Roy Ka-Wei |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t IEEE transactions on neural networks and learning systems |d 2012 |g 35(2024), 4 vom: 06. Apr., Seite 4887-4898 |w (DE-627)NLM23236897X |x 2162-2388 |7 nnns |
| 773 | 1 | 8 | |g volume:35 |g year:2024 |g number:4 |g day:06 |g month:04 |g pages:4887-4898 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1109/TNNLS.2022.3161697 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 35 |j 2024 |e 4 |b 06 |c 04 |h 4887-4898 | ||