Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach

Details Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach

2012-04-19

arxiv.org/abs/1204.4491v1

Computer Science

Social and Information Networks

Scientific paper

Influence maximization is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influence under a certain diffusion model. The Greedy algorithm for influence maximization first proposed by Kempe, later improved by Leskovec suffers from two sources of computational deficiency: 1) the need to evaluate many candidate nodes before selecting a new seed in each round, and 2) the calculation of the influence spread of any seed set relies on Monte-Carlo simulations. In this work, we tackle both problems by devising efficient algorithms to compute influence spread and determine the best candidate for seed selection. The fundamental insight behind the proposed algorithms is the linkage between influence spread determination and belief propagation on a directed acyclic graph (DAG). Experiments using real-world social network graphs with scales ranging from thousands to millions of edges demonstrate the superior performance of the proposed algorithms with moderate computation costs.

Affiliated with

Also associated with

No associations

Rating

Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Influence Spread in Large-Scale Social Networks - A Belief Propagation Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5000