An Effective Rumor Control Approach for Online Social Networks

Author(s):  
S. Santhoshkumar ◽  
L. D. Dhinesh Babu
2021 ◽  
Vol 33 (1) ◽  
pp. 47-70
Author(s):  
Santhoshkumar Srinivasan ◽  
Dhinesh Babu L. D.

Online social networks (OSNs) are used to connect people and propagate information around the globe. Along with information propagation, rumors also penetrate across the OSNs in a massive order. Controlling the rumor propagation is utmost important to reduce the damage it causes to society. Educating the individual participants of OSNs is one of the effective ways to control the rumor faster. To educate people in OSNs, this paper proposes a defensive rumor control approach that spreads anti-rumors by the inspiration from the immunization strategies of social insects. In this approach, a new information propagation model is defined to study the defensive nature of true information against rumors. Then, an anti-rumor propagation method with a set of influential spreaders is employed to defend against the rumor. The proposed approach is compared with the existing rumor containment approaches and the results indicate that the proposed approach works well in controlling the rumors.


2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Da-Wen Huang ◽  
Lu-Xing Yang ◽  
Xiaofan Yang ◽  
Yuan Yan Tang ◽  
Jichao Bi

Rumors have been widely spread in online social networks and they become a major concern in modern society. This paper is devoted to the design of a cost-effective rumor-containing scheme in online social networks through an optimal control approach. First, a new individual-based rumor spreading model is proposed, and the model considers the influence of the external environment on rumor spreading for the first time. Second, the cost-effectiveness is recommended to balance the loss caused by rumors against the cost of a rumor-containing scheme. On this basis, we reduce the original problem to an optimal control model. Next, we prove that this model is solvable, and we present the optimality system for the model. Finally, we show that the resulting rumor-containing scheme is cost-effective through extensive computer experiments.


2011 ◽  
Author(s):  
Seokchan Yun ◽  
Heungseok Do ◽  
Jinuk Jung ◽  
Song Mina ◽  
Namgoong Hyun ◽  
...  

2013 ◽  
Vol E96.B (11) ◽  
pp. 2774-2783 ◽  
Author(s):  
Safi-Ullah NASIR ◽  
Tae-Hyung KIM

Sign in / Sign up

Export Citation Format

Share Document