Article View/Open
Publication Export
Related Publications in TAIR
- > Simple Record
- > Full Record
| Field |
Value |
| Title: | Finding influential seed successors in social networks |
| Authors: | Li, C.-T.;Hsieh, Hsieh H.-P.;Lin, S.-D.;Shan, Man-Kwan
沈錳坤 |
| Contributors: | 資科系 |
| Keywords: | Coauthorship; Influence maximizations; Influential successors; Social Networks; Social networking (online); World Wide Web |
| Date: | 2012 |
| Issue Date: | 2015-04-17 10:55:47 (UTC+8) |
| 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). |
| Relation: | WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion |
| Data Type: | conference |
| DOI: | http://dx.doi.org/10.1145/2187980.2188125 |
| DCField |
Value |
Language |
| dc.contributor (Contributor) | 資科系 | |
| dc.creator (Authors) | Li, C.-T.;Hsieh, Hsieh H.-P.;Lin, S.-D.;Shan, Man-Kwan | |
| dc.creator (Authors) | 沈錳坤 | zh_TW |
| dc.date (Date) | 2012 | |
| dc.date.accessioned | 2015-04-17 10:55:47 (UTC+8) | - |
| dc.date.available | 2015-04-17 10:55:47 (UTC+8) | - |
| dc.date.issued (Issue Date) | 2015-04-17 10:55:47 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/74653 | - |
| dc.description.abstract (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 (Relation) | WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion | |
| dc.subject (Keywords) | Coauthorship; Influence maximizations; Influential successors; Social Networks; Social networking (online); World Wide Web | |
| dc.title (Title) | Finding influential seed successors in social networks | |
| dc.type (Data Type) | conference | en |
| dc.identifier.doi (DOI) | 10.1145/2187980.2188125 | |
| dc.doi.uri | http://dx.doi.org/10.1145/2187980.2188125 | |
(673)