Scalable influence maximization for prevalent viral marketing in large-scale social networks
Explore this paper's citation graph
Summary
The results from extensive simulations demonstrate that the proposed algorithm is currently the best scalable solution to the influence maximization problem and significantly outperforms all other scalable heuristics to as much as 100%--260% increase in influence spread.
- Type
- article
- Published
- 2010-07-25
- Cited by
- 1,824
- References
- 26
- OpenAlex
- https://openalex.org/W1984069252
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:1487845
Keywords
Scalability, Heuristics, Viral marketing, Maximization, Computer science
References
- An analysis of approximations for maximizing submodular set functions—I
- A threshold of ln n for approximating set cover (preliminary version)
- Information diffusion through blogspace
- Mining the network value of customers
- Mining knowledge-sharing sites for viral marketing
- Centrality in social networks conceptual clarification
- Maximizing the spread of influence through a social network
- The Anatomy of a Large-Scale Hypertextual Web Search Engine
- A random graph model for massive graphs
- Social influence analysis in large-scale networks
- Efficient influence maximization in social networks
- The Complexity of Enumeration and Reliability Problems
- An Online Algorithm for Maximizing Submodular Functions
- Cost-effective outbreak detection in networks
- Approximation Algorithms
- A threshold of ln n for approximating set cover
- Tractable Models for Information Diffusion in Social Networks
Cited by
- A fast approximation for influence maximization in large social networks
- Prediction in Social Media for Monitoring and Recommendation
- Learning Temporal Dynamics of Behavior Propagation in Social Networks
- Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations
- Simulated Annealing Based Influence Maximization in Social Networks
- Social capital: the power of influencers in networks
- Containment of Misinformation Propagation in Online Social Networks with given Deadline
- Revisiting Non-Progressive Influence Models: Scalable Influence Maximization in Social Networks
- Analyzing Social Influence through Social Media: A Structured Literature Review
- Understanding and Managing Propagation on Large Networks - Theory, Algorithms, and Models
- Node-Weighted Prize Collecting Steiner Tree and Applications
- Predicting viral Marketing Propagating Efficiency within given Deadline
- A subjective evidence model for influence maximization in social networks
- From Competition to Complementarity: Comparative Influence Diffusion and Maximization
- Negative Influence Minimizing by Blocking Nodes in Social Networks
- Data Mining
- Influence Maximization with Novelty Decay in Social Networks
- Lagrangian Decomposition Algorithm for Allocating Marketing Channels
- Computational Advertising: Techniques for Targeting Relevant Ads
- Don't Let Me Be #Misunderstood: Linguistically Motivated Algorithm for Predicting the Popularity of Textual Memes
Related papers
- LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions
- Conformity-Aware Influence Maximization with User Profiles
- Labeled Influence Maximization in Social Networks for Target Marketing
- On influence maximization to target users in the presence of multiple acceptances
- Influence Maximization in Social Network Considering Memory Effect and Social Reinforcement Effect
- Performance Analysis of Greedy-based Construction Heuristics on Classical Vehicle Routing Problem
- A novel approach for influence maximization in social networking