Efficient online summarization of large-scale dynamic networks

• Main Authors: QU, Qiang, LIU, Siyuan, ZHU, Feida, JENSEN, Christian S.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2016
• Subjects: Diffusion processes; Twitter; Electronic mail; Dynamic networks; Labeling; Graph theory; Databases and Information Systems; Social Media; Systems Architecture
• Online Access: https://ink.library.smu.edu.sg/sis_research/3449; https://ink.library.smu.edu.sg/context/sis_research/article/4450/viewcontent/EfficientOnlineSummarizationLSDynamicNetworks_2016_TKDE.pdf
• Institution: Singapore Management University

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