Finding influential seed successors in social networks

Authors:
Cheng-Te Li;Hsun-Ping Hsieh;Shou-De Lin;Man-Kwan Shan
Affiliations:
National Taiwan University, Taipei, Taiwan Roc;National Taiwan University, Taipei, Taiwan Roc;National Taiwan University, Taipei, Taiwan Roc;National Chengchi University, Taipei, Taiwan Roc
Venue:
Proceedings of the 21st international conference companion on World Wide Web
Year:
2012

Citing 9
Cited 1

Maximizing the spread of influence through a social network

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Cost-effective outbreak detection in networks

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient influence maximization in social networks

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable influence maximization for prevalent viral marketing in large-scale social networks

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Community-based greedy algorithm for mining top-K influential nodes in mobile social networks

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Finding effectors in social networks

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Finding influential mediators in social networks

Proceedings of the 20th international conference companion on World wide web
Sparsification of influence networks

Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A data-based approach to social influence maximization

Proceedings of the VLDB Endowment

Inferring the impacts of social media on crowdfunding

Proceedings of the 7th ACM international conference on Web search and data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a dynamic social network, nodes can be removed from the network for some reasons, and consequently affect the behaviors of the network. In this paper, we tackle the challenge of finding a successor node for each removed seed node to maintain the influence spread in the network. Given a social network and a set of seed nodes for influence maximization, who are the best successors to be transferred the jobs of initial influence propagation if some seeds are removed from the network. To tackle this problem, we present and discuss five neighborhood-based selection heuristics, including degree, degree discount, overlapping, community bridge, and community degree. Experiments on DBLP co-authorship network show the effectiveness of devised heuristics.