Improving information spread through a scheduled seeding approach

Alon Sela; Irad Ben-Gal; Alex Sandy Pentland; Erez Shmueli

doi:10.1145/2808797.2809399

Improving information spread through a scheduled seeding approach

Alon Sela, Irad Ben-Gal, Alex Sandy Pentland, Erez Shmueli

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

21 Scopus citations

Abstract

One highly studied aspect of social networks is the identification of influential nodes that can spread ideas in a highly efficient way. The vast majority of works in this field have investigated the problem of identifying a set of nodes, that if "seeded" simultaneously, would maximize the information spread in the network. Yet, the timing aspect, namely, finding not only which nodes should be seeded but also when to seed them, has not been sufficiently addressed. In this work, we revisit the problem of network seeding and demonstrate by simulations how an approach takes takes into account the timing aspect, can improve the rates of spread by over 23% compared to existing seeding methods. Such an approach has a wide range of applications, especially in cases where the network topology is easily accessible.

Original language	English
Title of host publication	Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015
Editors	Jian Pei, Jie Tang, Fabrizio Silvestri
Publisher	Association for Computing Machinery, Inc
Pages	629-632
Number of pages	4
ISBN (Electronic)	9781450338547
DOIs	https://doi.org/10.1145/2808797.2809399
State	Published - 25 Aug 2015
Externally published	Yes
Event	IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015 - Paris, France Duration: 25 Aug 2015 → 28 Aug 2015

Publication series

Name	Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015

Conference

Conference	IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015
Country/Territory	France
City	Paris
Period	25/08/15 → 28/08/15

Bibliographical note

Publisher Copyright:
© 2015 ACM.

Access to Document

10.1145/2808797.2809399

Cite this

Sela, A., Ben-Gal, I., Pentland, A. S., & Shmueli, E. (2015). Improving information spread through a scheduled seeding approach. In J. Pei, J. Tang, & F. Silvestri (Eds.), Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015 (pp. 629-632). (Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015). Association for Computing Machinery, Inc. https://doi.org/10.1145/2808797.2809399

Sela, Alon ; Ben-Gal, Irad ; Pentland, Alex Sandy et al. / Improving information spread through a scheduled seeding approach. Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015. editor / Jian Pei ; Jie Tang ; Fabrizio Silvestri. Association for Computing Machinery, Inc, 2015. pp. 629-632 (Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015).

@inproceedings{c27b5651de954b539c1628b4936af240,

title = "Improving information spread through a scheduled seeding approach",

abstract = "One highly studied aspect of social networks is the identification of influential nodes that can spread ideas in a highly efficient way. The vast majority of works in this field have investigated the problem of identifying a set of nodes, that if {"}seeded{"} simultaneously, would maximize the information spread in the network. Yet, the timing aspect, namely, finding not only which nodes should be seeded but also when to seed them, has not been sufficiently addressed. In this work, we revisit the problem of network seeding and demonstrate by simulations how an approach takes takes into account the timing aspect, can improve the rates of spread by over 23% compared to existing seeding methods. Such an approach has a wide range of applications, especially in cases where the network topology is easily accessible.",

author = "Alon Sela and Irad Ben-Gal and Pentland, {Alex Sandy} and Erez Shmueli",

note = "Publisher Copyright: {\textcopyright} 2015 ACM.; IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015 ; Conference date: 25-08-2015 Through 28-08-2015",

year = "2015",

month = aug,

day = "25",

doi = "10.1145/2808797.2809399",

language = "אנגלית",

series = "Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015",

publisher = "Association for Computing Machinery, Inc",

pages = "629--632",

editor = "Jian Pei and Jie Tang and Fabrizio Silvestri",

booktitle = "Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015",

}

Sela, A, Ben-Gal, I, Pentland, AS & Shmueli, E 2015, Improving information spread through a scheduled seeding approach. in J Pei, J Tang & F Silvestri (eds), Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015. Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Association for Computing Machinery, Inc, pp. 629-632, IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015, Paris, France, 25/08/15. https://doi.org/10.1145/2808797.2809399

Improving information spread through a scheduled seeding approach. / Sela, Alon; Ben-Gal, Irad; Pentland, Alex Sandy et al.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015. ed. / Jian Pei; Jie Tang; Fabrizio Silvestri. Association for Computing Machinery, Inc, 2015. p. 629-632 (Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Improving information spread through a scheduled seeding approach

AU - Sela, Alon

AU - Ben-Gal, Irad

AU - Pentland, Alex Sandy

AU - Shmueli, Erez

PY - 2015/8/25

Y1 - 2015/8/25

N2 - One highly studied aspect of social networks is the identification of influential nodes that can spread ideas in a highly efficient way. The vast majority of works in this field have investigated the problem of identifying a set of nodes, that if "seeded" simultaneously, would maximize the information spread in the network. Yet, the timing aspect, namely, finding not only which nodes should be seeded but also when to seed them, has not been sufficiently addressed. In this work, we revisit the problem of network seeding and demonstrate by simulations how an approach takes takes into account the timing aspect, can improve the rates of spread by over 23% compared to existing seeding methods. Such an approach has a wide range of applications, especially in cases where the network topology is easily accessible.

AB - One highly studied aspect of social networks is the identification of influential nodes that can spread ideas in a highly efficient way. The vast majority of works in this field have investigated the problem of identifying a set of nodes, that if "seeded" simultaneously, would maximize the information spread in the network. Yet, the timing aspect, namely, finding not only which nodes should be seeded but also when to seed them, has not been sufficiently addressed. In this work, we revisit the problem of network seeding and demonstrate by simulations how an approach takes takes into account the timing aspect, can improve the rates of spread by over 23% compared to existing seeding methods. Such an approach has a wide range of applications, especially in cases where the network topology is easily accessible.

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

U2 - 10.1145/2808797.2809399

DO - 10.1145/2808797.2809399

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84962486579

T3 - Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015

SP - 629

EP - 632

BT - Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015

A2 - Pei, Jian

A2 - Tang, Jie

A2 - Silvestri, Fabrizio

PB - Association for Computing Machinery, Inc

T2 - IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015

Y2 - 25 August 2015 through 28 August 2015

ER -

Sela A, Ben-Gal I, Pentland AS, Shmueli E. Improving information spread through a scheduled seeding approach. In Pei J, Tang J, Silvestri F, editors, Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015. Association for Computing Machinery, Inc. 2015. p. 629-632. (Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2015). doi: 10.1145/2808797.2809399

Improving information spread through a scheduled seeding approach

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this