Results 31 to 40 of about 1,438 (192)

Graph Convolutional-Based Deep Residual Modeling for Rumor Detection on Social Media

open access: yesMathematics, 2023
The popularity and development of social media have made it more and more convenient to spread rumors, and it has become especially important to detect rumors in massive amounts of information.
Na Ye   +4 more
doaj   +1 more source

Modeling and Analysis of Rumor Control Strategies in Social Networks [PDF]

open access: yesComputer and Knowledge Engineering, 2022
Todays, although social networks are used for extensive information sharing, spreading rumors has also been accelerated and become a serious problem. Rumor control can be accomplished through either hard or soft control strategies.
Mojgan Askarizade   +2 more
doaj   +1 more source

BiMGCL: rumor detection via bi-directional multi-level graph contrastive learning [PDF]

open access: yesPeerJ Computer Science, 2023
The rapid development of large language models has significantly reduced the cost of producing rumors, which brings a tremendous challenge to the authenticity of content on social media. Therefore, it has become crucially important to identify and detect
Weiwei Feng   +4 more
doaj   +2 more sources

Rumor propagation in two-layer complex networks

open access: yes, 2023
With the development of information networks, the study on rumor propagation attracts more and more attention. In this paper, we investigate rumor propagation in two-layer complex networks with three groups of agents: spreaders, ignorants, and refuters ...
Yu Cao   +4 more
core   +1 more source

Rumor Detection Based on Representative User Characteristics Learning Through Propagation [PDF]

open access: yesJisuanji kexue yu tansuo, 2022
Effective rumor detection and management has become an essential part of Internet plus government services initiative. The Internet era brings great convenience to people’s communication as well as speeds up the propagation of rumors, which not ...
XIE Xintong, HU Yueyang, LIU Xuanzhe, ZHAO Yaoshuai, JIANG Hai’ou
doaj   +1 more source

Rumor propagation meets skepticism: A parallel with zombies [PDF]

open access: yesEPL (Europhysics Letters), 2018
We propose a model of rumor spreading in which susceptible, but skeptically oriented individuals may oppose the rumor. Resistance may be implemented either by skeptical activists trying to convince spreaders to stop their activity, becoming stiflers or, passively (non-reactive) as a consequence, for example, of fact-checking.
Amaral, Marco Antonio   +1 more
openaire   +2 more sources

Spread Mechanism and Control Strategies of Rumor Propagation Model Considering Rumor Refutation and Information Feedback in Emergency Management

open access: yes, 2021
The rumor-free equilibrium state and rumor-endemic equilibrium state are two symmetric descriptions of the status of a system. The constant spreading of rumors would affect the smooth operation of emergency management procedures and cause unnecessary ...
Raoqing Xie   +6 more
core   +1 more source

Heterogeneous Graph Convolutional Network-Based Dynamic Rumor Detection on Social Media

open access: yesComplexity, 2022
The development of social media has provided open and convenient platforms for people to express their opinions, which leads to rumors being circulated. Therefore, detecting rumors from massive information becomes particularly essential. Previous methods
Dingguo Yu   +3 more
doaj   +1 more source

Climate-denying rumor propagation in a coupled socio-climate model: Impact on average global temperature. [PDF]

open access: yesPLoS One
Individual attitudes vastly affect the transformations we are experiencing and are vital in mitigating or intensifying climate change. A socio-climate model by coupling a model of rumor dynamics in heterogeneous networks to a simple Earth System model is
Satheesh Kumar A, Bauch CT, Anand M.
europepmc   +2 more sources

Total Flooding Time and Rumor Propagation on Graphs [PDF]

open access: yesJournal of Statistical Physics, 2017
We study a model of rumor propagation in discrete time where each site in the graph has initially a distinct information; we are interested in the number of "conversations" before the entire graph knows all informations. This problem can be described as a flooding time problem with multiple liquids.
Darcy Camargo, Serguei Popov
openaire   +3 more sources

Home - About - Disclaimer - Privacy