Evidence map›Paper›PMID 38648224›Full record

ArticlePloS one2024

Rumor detection based on Attention Graph Adversarial Dual Contrast Learning.

Bing Zhang, Tao Liu, Zunwang Ke, Yanbing Li, Wushour Silamu

Abstract read
In one paragraph

Article in PloS one, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Bing ZhangSchool of Information Science and Engineering, Xinjiang University, Urumqi, China.
Tao LiuXinjiang Multilingual Information Technology Laboratory, Xinjiang University, Urumqi, China.
Zunwang KeXinjiang Multilingual Information Technology Research Center, Xinjiang University, Urumqi, China.
Yanbing LiXinjiang Multilingual Information Technology Laboratory, Xinjiang University, Urumqi, China.ORCID 0000-0001-5368-6921
Wushour SilamuXinjiang Multilingual Information Technology Laboratory, Xinjiang University, Urumqi, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

It is becoming harder to tell rumors from non-rumors as social media becomes a key news source, which invites malicious manipulation that could do harm to the public's health or cause financial loss. When faced with situations when the session structure of comment sections is deliberately disrupted, traditional models do not handle them adequately. In order to do this, we provide a novel rumor detection architecture that combines dual comparison learning, adversarial training, and attention filters. We suggest the attention filter module to achieve the filtering of some dangerous comments as well as the filtering of some useless comments, allowing the nodes to enter the GAT graph neural network with greater structural information. The adversarial training module (ADV) simulates the occurrence of malicious comments through perturbation, giving the comments some defense against malicious comments. It also serves as a hard negative sample to aid double contrast learning (DCL), which aims to learn the differences between various comments, and incorporates the final loss in the form of a loss function to strengthen the model. According to experimental findings, our AGAD (Attention Graph Adversarial Dual Contrast Learning) model outperforms other cutting-edge algorithms on a number of rumor detection tasks. The code is available at https://github.com/icezhangGG/AGAD.git.

Indexed as

AlgorithmsNeural Networks, ComputerSocial MediaAttentionHumansMachine Learning

Identifiers

PMID38648224
PMCPMC11034658

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.