Publications-Proceedings

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Finding influential seed successors in social networks
作者 Li, C.-T.;Hsieh, Hsieh H.-P.;Lin, S.-D.;Shan, Man-Kwan
沈錳坤
貢獻者 資科系
關鍵詞 Coauthorship; Influence maximizations; Influential successors; Social Networks; Social networking (online); World Wide Web
日期 2012
上傳時間 17-Apr-2015 10:55:47 (UTC+8)
摘要 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).
關聯 WWW`12 - Proceedings of the 21st Annual Conference on World Wide Web Companion
資料類型 conference
DOI http://dx.doi.org/10.1145/2187980.2188125
dc.contributor 資科系
dc.creator (作者) Li, C.-T.;Hsieh, Hsieh H.-P.;Lin, S.-D.;Shan, Man-Kwan
dc.creator (作者) 沈錳坤zh_TW
dc.date (日期) 2012
dc.date.accessioned 17-Apr-2015 10:55:47 (UTC+8)-
dc.date.available 17-Apr-2015 10:55:47 (UTC+8)-
dc.date.issued (上傳時間) 17-Apr-2015 10:55:47 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/74653-
dc.description.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).
dc.format.extent 176 bytes-
dc.format.mimetype text/html-
dc.relation (關聯) WWW`12 - Proceedings of the 21st Annual Conference on World Wide Web Companion
dc.subject (關鍵詞) Coauthorship; Influence maximizations; Influential successors; Social Networks; Social networking (online); World Wide Web
dc.title (題名) Finding influential seed successors in social networks
dc.type (資料類型) conferenceen
dc.identifier.doi (DOI) 10.1145/2187980.2188125
dc.doi.uri (DOI) http://dx.doi.org/10.1145/2187980.2188125