Finding influential seed successors in social networks

Cheng-Te Li, Hsun-Ping Hsieh, Shou De Lin, Man Kwan Shan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

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, the problem is to effectively choose successors to inherit the jobs of initial influence propagation when some seeds are removed from the network. To tackle this problem, we present and discuss five neighborhoodbased selection heuristics, including degree, degree discount, overlapping, community bridge, and community degree. Experiments on DBLP co-authorship network show the effectiveness of devised heuristics. Copyright is held by the author/owner(s).

Original languageEnglish
Title of host publicationWWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion
Pages557-558
Number of pages2
DOIs
Publication statusPublished - 2012 May 21
Event21st Annual Conference on World Wide Web, WWW'12 - Lyon, France
Duration: 2012 Apr 162012 Apr 20

Publication series

NameWWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion

Other

Other21st Annual Conference on World Wide Web, WWW'12
CountryFrance
CityLyon
Period12-04-1612-04-20

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Finding influential seed successors in social networks'. Together they form a unique fingerprint.

Cite this