Negative Influence Minimizing by Blocking Nodes in Social Networks
Explore this paper's citation graph
Summary
The comparison experimental results on the Enron email network dataset demonstrate the proposed greedy method is more effective than centrality based methods, such as degree centrality, betweenness centrality and PageRank.
- Type
- article
- Published
- 2013-01-01
- Cited by
- 72
- References
- 9
- OpenAlex
- https://openalex.org/W828504312
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:17916884
Keywords
Betweenness centrality, Rumor, Centrality, PageRank, Blocking (statistics)
References
- The PageRank Citation Ranking : Bringing Order to the Web
- Scalable influence maximization for prevalent viral marketing in large-scale social networks
- Maximizing the spread of influence through a social network
- On variants of shortest-path betweenness centrality and their generic computation
- Influence propagation in adversarial setting: how to defeat competition with least amount of investment
- Limiting the spread of misinformation in social networks
- A Semi-Supervised Bayesian Network Model for Microblog Topic Classification
- Minimizing the Spread of Contamination by Blocking Links in a Network
- Finding Spread Blockers in Dynamic Networks
Cited by
- Topic-aware Social Influence Minimization
- On social network firewall selection
- Understanding Social Causalities Behind Human Action Sequences
- Minimisation de l'influence négative dans les réseaux sociaux
- Optimal Resource Allocation in Social and Critical Infrastructure Networks
- Limiting Concept Spread in Environments with Interacting Concepts
- Modelling Multiple Influences Diffusion in On-line Social Networks
- Manipulating concept spread using concept relationships
- Influence-oriented community analysis in social networks
- Rumor Blocking through Online Link Deletion on Social Networks
- Minimizing Influence of Rumors by Blockers on Social Networks: Algorithms and Analysis
- Influence Minimization Algorithm Based on Coordination Game
- Targeted Protection Maximization in Social Networks
- Minimizing the misinformation spread in social networks
- A Multi-Feature Diffusion Model: Rumor Blocking in Social Networks
- Efficient targeted influence minimization in big social networks
- Positive Information Diffusion for Rumor Containment in Online Social Networks
- Activity Minimization of Misinformation Influence in Online Social Networks
- Spike-based graph centrality measures
- Adapting Security Warnings to Counter Online Disinformation
Related papers
- Maximizing the spread of influence through a social network
- Limiting the spread of misinformation in social networks
- Minimizing the Spread of Contamination by Blocking Links in a Network
- Least Cost Rumor Blocking in Social Networks
- Mining the network value of customers
- Scalable influence maximization for prevalent viral marketing in large-scale social networks
- Scalable diffusion-aware optimization of network topology
- Containment of misinformation spread in online social networks
- An Efficient Randomized Algorithm for Rumor Blocking in Online Social Networks