Finding influential mediators in social networks

Cheng-Te Li, Shou De Lin, Man Kwan Shan

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

9 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 20th International Conference Companion on World Wide Web, WWW 2011
Pages75-76
Number of pages2
DOIs
Publication statusPublished - 2011 Apr 29
Event20th International Conference Companion on World Wide Web, WWW 2011 - Hyderabad, India
Duration: 2011 Mar 282011 Apr 1

Publication series

NameProceedings of the 20th International Conference Companion on World Wide Web, WWW 2011

Other

Other20th International Conference Companion on World Wide Web, WWW 2011
CountryIndia
CityHyderabad
Period11-03-2811-04-01

Fingerprint

Seed
Chemical activation
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Cite this

Li, C-T., Lin, S. D., & Shan, M. K. (2011). Finding influential mediators in social networks. In Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011 (pp. 75-76). (Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011). https://doi.org/10.1145/1963192.1963231
Li, Cheng-Te ; Lin, Shou De ; Shan, Man Kwan. / Finding influential mediators in social networks. Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011. 2011. pp. 75-76 (Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011).
@inproceedings{efd1d2119c274e7a8d8d9c65a91a6f2f,
title = "Finding influential mediators in social networks",
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.",
author = "Cheng-Te Li and Lin, {Shou De} and Shan, {Man Kwan}",
year = "2011",
month = "4",
day = "29",
doi = "10.1145/1963192.1963231",
language = "English",
isbn = "9781450305181",
series = "Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011",
pages = "75--76",
booktitle = "Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011",

}

Li, C-T, Lin, SD & Shan, MK 2011, Finding influential mediators in social networks. in Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011. Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011, pp. 75-76, 20th International Conference Companion on World Wide Web, WWW 2011, Hyderabad, India, 11-03-28. https://doi.org/10.1145/1963192.1963231

Finding influential mediators in social networks. / Li, Cheng-Te; Lin, Shou De; Shan, Man Kwan.

Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011. 2011. p. 75-76 (Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011).

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

TY - GEN

T1 - Finding influential mediators in social networks

AU - Li, Cheng-Te

AU - Lin, Shou De

AU - Shan, Man Kwan

PY - 2011/4/29

Y1 - 2011/4/29

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79955163890&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955163890&partnerID=8YFLogxK

U2 - 10.1145/1963192.1963231

DO - 10.1145/1963192.1963231

M3 - Conference contribution

SN - 9781450305181

T3 - Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011

SP - 75

EP - 76

BT - Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011

ER -

Li C-T, Lin SD, Shan MK. Finding influential mediators in social networks. In Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011. 2011. p. 75-76. (Proceedings of the 20th International Conference Companion on World Wide Web, WWW 2011). https://doi.org/10.1145/1963192.1963231