• Corpus ID: 226289992

Competitive Influence Propagation and Fake News Mitigation in the Presence of Strong User Bias

  title={Competitive Influence Propagation and Fake News Mitigation in the Presence of Strong User Bias},
  author={Akrati Saxena and Harsh Saxena and Ralucca Gera},
Due to the extensive role of social networks in social media, it is easy for people to share the news, and it spreads faster than ever before. These platforms also have been exploited to share the rumor or fake information, which is a threat to society. One method to reduce the impact of fake information is making people aware of the correct information based on hard proof. In this work, first, we propose a propagation model called Competitive Independent Cascade Model with users' Bias (CICMB… 
1 Citations

Figures and Tables from this paper

CNMF: A Community-Based Fake News Mitigation Framework
This paper proposes a generic mitigation framework, where the social crowd can be employed to combat the influence of fake news in OSNs when the infected set of users is undefined, and pins the significance of facts searching and news propagator’s behavior features introduced in the experimental results.


Mitigating Misinformation in Online Social Network with Top-k Debunkers and Evolving User Opinions
A new opinion model is proposed that takes into account users’ biases and their social neighbours’ opinions and design a mitigation solution to identify a subset of debunkers that maximizes the number of users who have been exposed to the misinformation but choose to believe the counter message.
Temporal Influence Blocking: Minimizing the Effect of Misinformation in Social Networks
A two-phase solution called TIB-Solver to select k nodes to start a truth campaign such that the number of users reached by a rumor is minimized and experiments show that the proposed TIBSolver outperforms the state-of-the-art algorithms in terms of both effectiveness and efficiency.
An efficient randomized algorithm for rumor blocking in online social networks
  • G. Tong, Weili Wu, D. Du
  • Computer Science
    IEEE INFOCOM 2017 - IEEE Conference on Computer Communications
  • 2017
A randomized rumor blocking algorithm which runs in O(km ln n/δ2) expected time and provides a (1 − 1/e − δ)-approximation with a high probability is presented.
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network and address the problem of influence limitation where a "bad" campaign starts propagating from a certain node in the
Contrasting the Spread of Misinformation in Online Social Networks
This paper focuses on two problems related to the diffusion of misinformation in social networks: identify the misinformation sources and limit its diffusion in the network, and provides an heuristics to recognize the set of most probable sources of the infection.
Least Cost Rumor Influence Minimization in Multiplex Social Networks
The Least Cost Anti-rumor Campaign (LCAC) problem is introduced to minimize the influence of the rumor and a greedy algorithm is introduced that guarantees an approximation within \((1-1/\textit{e})\) of the optimal solution.
Containment of misinformation spread in online social networks
Empirical results indicate that the β1T -- Node Protectors methods are among the best ones for hinting out those important nodes in comparison with other available methods for limit viral propagation of misinformation in OSNs.
Topic-aware social influence propagation models
Novel topic-aware influence-driven propagation models that are more accurate in describing real-world cascades than the standard (i.e., topic-blind) propagation models studied in the literature are introduced.
A community-based algorithm for influence blocking maximization in social networks
The influence blocking maximization (IBM) problem which aims to find a subset of nodes that need to adopt the positive influence to minimize the number of node that adopt the negative influence at the end of both propagation processes is addressed in this work.
The spread of true and false news online
A large-scale analysis of tweets reveals that false rumors spread further and faster than the truth, and false news was more novel than true news, which suggests that people were more likely to share novel information.