| dc.contributor | 資科系 | |
| dc.creator (作者) | Li, Cheng-Te;Lin, Shou-De;Shan, Man-Kwan | |
| dc.creator (作者) | 李政德;林守德;沈錳坤 | zh_TW |
| dc.date (日期) | 2011 | |
| dc.date.accessioned | 8-Oct-2015 17:49:07 (UTC+8) | - |
| dc.date.available | 8-Oct-2015 17:49:07 (UTC+8) | - |
| dc.date.issued (上傳時間) | 8-Oct-2015 17:49:07 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/78908 | - |
| dc.description.abstract (摘要) | Given a social network, who are the key players controlling the bottlenecks of influence propagation if some persons would like to activate specific individuals? In this paper, we tackle the problem of selecting a set of k mediator nodes as the influential gateways whose existence determines the activation probabilities of targeted nodes from some given seed nodes. We formally define the k-Mediators problem. To have an effective and efficient solution, we propose a three-step greedy method by considering the probabilistic influence and the structural connectivity on the pathways from sources to targets. To the best of our knowledge, this is the first work to consider the k-Mediators problem in networks. Experiments on the DBLP co-authorship graph show the effectiveness and efficiency of the proposed method. © 2011 Authors. | |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011 | |
| dc.subject (關鍵詞) | Activation probabilities; Co-authorship graphs; Greedy method; influential mediator; social networks; Structural connectivity; Viral marketing; Marketing; Social networking (online); World Wide Web | |
| dc.title (題名) | Finding influential mediators in social networks | |
| dc.type (資料類型) | conference | en |
| dc.identifier.doi (DOI) | 10.1145/1963192.1963231 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1145/1963192.1963231 | |
