Learning clusters through information diffusion

Liudmila Prokhorenkova, Alexey Tikhonov, Nelly Litvak

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

When information or infectious diseases spread over a network, in many practical cases, one can observe when nodes adopt information or become infected, but the underlying network is hidden. In this paper, we analyze the problem of finding communities of highly interconnected nodes, given only the infection times of nodes. We propose, analyze, and empirically compare several algorithms for this task. The most stable performance, that improves the current state-of-the-art, is obtained by our proposed heuristic approaches, that are agnostic to a particular graph structure and epidemic model.

Original languageEnglish
Title of host publicationThe Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc
Pages3151-3157
Number of pages7
ISBN (Electronic)978-1-4503-6674-8
DOIs
Publication statusPublished - 13 May 2019
Event2019 World Wide Web Conference, WWW 2019 - San Francisco, United States
Duration: 13 May 201917 May 2019

Conference

Conference2019 World Wide Web Conference, WWW 2019
CountryUnited States
CitySan Francisco
Period13/05/1917/05/19

Keywords

  • Community detection
  • Information cascades
  • Information propagation
  • Likelihood optimization
  • Network inference

Cite this

Prokhorenkova, L., Tikhonov, A., & Litvak, N. (2019). Learning clusters through information diffusion. In The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019 (pp. 3151-3157). New York: Association for Computing Machinery, Inc. https://doi.org/10.1145/3308558.3313560
Prokhorenkova, Liudmila ; Tikhonov, Alexey ; Litvak, Nelly. / Learning clusters through information diffusion. The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019. New York : Association for Computing Machinery, Inc, 2019. pp. 3151-3157
@inproceedings{9ea8797e23ff42a988bcdd98fc017828,
title = "Learning clusters through information diffusion",
abstract = "When information or infectious diseases spread over a network, in many practical cases, one can observe when nodes adopt information or become infected, but the underlying network is hidden. In this paper, we analyze the problem of finding communities of highly interconnected nodes, given only the infection times of nodes. We propose, analyze, and empirically compare several algorithms for this task. The most stable performance, that improves the current state-of-the-art, is obtained by our proposed heuristic approaches, that are agnostic to a particular graph structure and epidemic model.",
keywords = "Community detection, Information cascades, Information propagation, Likelihood optimization, Network inference",
author = "Liudmila Prokhorenkova and Alexey Tikhonov and Nelly Litvak",
year = "2019",
month = "5",
day = "13",
doi = "10.1145/3308558.3313560",
language = "English",
pages = "3151--3157",
booktitle = "The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019",
publisher = "Association for Computing Machinery, Inc",
address = "United States",

}

Prokhorenkova, L, Tikhonov, A & Litvak, N 2019, Learning clusters through information diffusion. in The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019. Association for Computing Machinery, Inc, New York, pp. 3151-3157, 2019 World Wide Web Conference, WWW 2019, San Francisco, United States, 13/05/19. https://doi.org/10.1145/3308558.3313560

Learning clusters through information diffusion. / Prokhorenkova, Liudmila; Tikhonov, Alexey; Litvak, Nelly.

The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019. New York : Association for Computing Machinery, Inc, 2019. p. 3151-3157.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Learning clusters through information diffusion

AU - Prokhorenkova, Liudmila

AU - Tikhonov, Alexey

AU - Litvak, Nelly

PY - 2019/5/13

Y1 - 2019/5/13

N2 - When information or infectious diseases spread over a network, in many practical cases, one can observe when nodes adopt information or become infected, but the underlying network is hidden. In this paper, we analyze the problem of finding communities of highly interconnected nodes, given only the infection times of nodes. We propose, analyze, and empirically compare several algorithms for this task. The most stable performance, that improves the current state-of-the-art, is obtained by our proposed heuristic approaches, that are agnostic to a particular graph structure and epidemic model.

AB - When information or infectious diseases spread over a network, in many practical cases, one can observe when nodes adopt information or become infected, but the underlying network is hidden. In this paper, we analyze the problem of finding communities of highly interconnected nodes, given only the infection times of nodes. We propose, analyze, and empirically compare several algorithms for this task. The most stable performance, that improves the current state-of-the-art, is obtained by our proposed heuristic approaches, that are agnostic to a particular graph structure and epidemic model.

KW - Community detection

KW - Information cascades

KW - Information propagation

KW - Likelihood optimization

KW - Network inference

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

U2 - 10.1145/3308558.3313560

DO - 10.1145/3308558.3313560

M3 - Conference contribution

AN - SCOPUS:85066907369

SP - 3151

EP - 3157

BT - The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019

PB - Association for Computing Machinery, Inc

CY - New York

ER -

Prokhorenkova L, Tikhonov A, Litvak N. Learning clusters through information diffusion. In The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019. New York: Association for Computing Machinery, Inc. 2019. p. 3151-3157 https://doi.org/10.1145/3308558.3313560