Efficient Online Summarization of Large-Scale Dynamic Networks

Qiang Qu, Siyuan Liu, Feida Zhu, Christian S. Jensen

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

Information diffusion in social networks is often characterized by huge participating communities and viral cascades of high dynamicity. To observe, summarize, and understand the evolution of dynamic diffusion processes in an informative and insightful way is a challenge of high practical value. However, few existing studies aim to summarize networks for interesting dynamic patterns. Dynamic networks raise new challenges not found in static settings, including time sensitivity, online interestingness evaluation, and summary traceability, which render existing techniques inadequate. We propose dynamic network summarization to summarize dynamic networks with millions of nodes by only capturing the few most interesting nodes or edges over time. Based on the concepts of diffusion radius and scope, we define interestingness measures for dynamic networks, and we propose OSNet, an online summarization framework for dynamic networks. Efficient algorithms are included in OSNet. We report on extensive experiments with both synthetic and real-life data. The study offers insight into the effectiveness, efficiency, and design properties of OSNet.

Original languageEnglish (US)
Article number7549016
Pages (from-to)3231-3245
Number of pages15
JournalIEEE Transactions on Knowledge and Data Engineering
Volume28
Issue number12
DOIs
StatePublished - Dec 1 2016

Fingerprint

Experiments

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

Qu, Qiang ; Liu, Siyuan ; Zhu, Feida ; Jensen, Christian S. / Efficient Online Summarization of Large-Scale Dynamic Networks. In: IEEE Transactions on Knowledge and Data Engineering. 2016 ; Vol. 28, No. 12. pp. 3231-3245.
@article{7f49a0e6eed7426c85613890fd566986,
title = "Efficient Online Summarization of Large-Scale Dynamic Networks",
abstract = "Information diffusion in social networks is often characterized by huge participating communities and viral cascades of high dynamicity. To observe, summarize, and understand the evolution of dynamic diffusion processes in an informative and insightful way is a challenge of high practical value. However, few existing studies aim to summarize networks for interesting dynamic patterns. Dynamic networks raise new challenges not found in static settings, including time sensitivity, online interestingness evaluation, and summary traceability, which render existing techniques inadequate. We propose dynamic network summarization to summarize dynamic networks with millions of nodes by only capturing the few most interesting nodes or edges over time. Based on the concepts of diffusion radius and scope, we define interestingness measures for dynamic networks, and we propose OSNet, an online summarization framework for dynamic networks. Efficient algorithms are included in OSNet. We report on extensive experiments with both synthetic and real-life data. The study offers insight into the effectiveness, efficiency, and design properties of OSNet.",
author = "Qiang Qu and Siyuan Liu and Feida Zhu and Jensen, {Christian S.}",
year = "2016",
month = "12",
day = "1",
doi = "10.1109/TKDE.2016.2601611",
language = "English (US)",
volume = "28",
pages = "3231--3245",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "12",

}

Efficient Online Summarization of Large-Scale Dynamic Networks. / Qu, Qiang; Liu, Siyuan; Zhu, Feida; Jensen, Christian S.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 28, No. 12, 7549016, 01.12.2016, p. 3231-3245.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient Online Summarization of Large-Scale Dynamic Networks

AU - Qu, Qiang

AU - Liu, Siyuan

AU - Zhu, Feida

AU - Jensen, Christian S.

PY - 2016/12/1

Y1 - 2016/12/1

N2 - Information diffusion in social networks is often characterized by huge participating communities and viral cascades of high dynamicity. To observe, summarize, and understand the evolution of dynamic diffusion processes in an informative and insightful way is a challenge of high practical value. However, few existing studies aim to summarize networks for interesting dynamic patterns. Dynamic networks raise new challenges not found in static settings, including time sensitivity, online interestingness evaluation, and summary traceability, which render existing techniques inadequate. We propose dynamic network summarization to summarize dynamic networks with millions of nodes by only capturing the few most interesting nodes or edges over time. Based on the concepts of diffusion radius and scope, we define interestingness measures for dynamic networks, and we propose OSNet, an online summarization framework for dynamic networks. Efficient algorithms are included in OSNet. We report on extensive experiments with both synthetic and real-life data. The study offers insight into the effectiveness, efficiency, and design properties of OSNet.

AB - Information diffusion in social networks is often characterized by huge participating communities and viral cascades of high dynamicity. To observe, summarize, and understand the evolution of dynamic diffusion processes in an informative and insightful way is a challenge of high practical value. However, few existing studies aim to summarize networks for interesting dynamic patterns. Dynamic networks raise new challenges not found in static settings, including time sensitivity, online interestingness evaluation, and summary traceability, which render existing techniques inadequate. We propose dynamic network summarization to summarize dynamic networks with millions of nodes by only capturing the few most interesting nodes or edges over time. Based on the concepts of diffusion radius and scope, we define interestingness measures for dynamic networks, and we propose OSNet, an online summarization framework for dynamic networks. Efficient algorithms are included in OSNet. We report on extensive experiments with both synthetic and real-life data. The study offers insight into the effectiveness, efficiency, and design properties of OSNet.

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

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

U2 - 10.1109/TKDE.2016.2601611

DO - 10.1109/TKDE.2016.2601611

M3 - Article

AN - SCOPUS:84996528886

VL - 28

SP - 3231

EP - 3245

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 12

M1 - 7549016

ER -