سند علمی

ECOviz: Comparative Visualization of Time-Evolving Network Summaries

چکیده

How can we visualize, interact with, and ‘learn’ important structures of time-evolving networks? Given domain-speci€c aŠributes, such as node membership of functional brain regions, how can we use this domain knowledge to discover coherent structures and track their evolution over time? In this demo paper, we introduce ECOviz (for Evolving COmparative network visualization), a system that enables pairwise comparison of temporal graph summaries based on variations in data source and preprocessing parameters. Our system further allows the user to perform structural and temporal analysis of a graph through ecient querying and visualization of its summarizing subgraphs. ECOviz performs the following tasks: (a) It generates a set of temporal structures for each graph of interest using a dynamic graph summarization algorithm o„ine; (b) It supports contrasting visual analysis of time-evolving network pairs by providing quantitative metrics on summary structure composition and temporal graph statistics; (c) It interactively visualizes the induced subgraph of each structure in a summary, at either a full time sequence or a time interval speci€ed by the user. In our demonstration, we invite the audience to use ECOviz to make comparisons between a variety of time-evolving functional human connectomes, and explore their salient temporal structures. ACM Reference format: Lisa Jin and Danai Koutra. 2017. ECOviz: Comparative Visualization of Time-Evolving Network Summaries. In KDD 2017 Workshop on Interactive Data Exploration and Analytics (IDEA’17), Halifax, Nova Scotia, Canada, August 14th, 2017, 8 pages.

اسناد مشابه

  • Model-Based Clustering of Time-Evolving Networks through Temporal Exponential-Family Random Graph Models

    سند علمی۲۰۱۷CoRRKevin H. Lee, Lingzhou Xue, David R. Hunter

    Dynamic networks are a general language for describing time-evolving complex systems, and discrete time network models provide an emerging statistical technique for various applications. It is a fundamental research question to detect the community structure in time-evolving netw

  • How Complex Contagions Spread Quickly in the Preferential Attachment Model and Other Time-Evolving Networks

    سند علمی۲۰۱۴Roozbeh Ebrahimi, Jie Gao, Golnaz Ghasemiesfeh, Grant Schoenebeck

    In this paper, we study the spreading speed of complex contagions in a social network. A k-complex contagion starts from a set of initially infected seeds such that any node with at least k infected neighbors gets infected. Simple contagions, i.e., k = 1, quickly spread to the en

  • Evolving Cluster Mixed-Membership Blockmodel for Time-Evolving Networks

    سند علمی۲۰۱۱AISTATSQirong Ho, Le Song, Eric P. Xing

    Time-evolving networks are a natural representation for dynamic social and biological interactions. While latent space models are gaining popularity in network modeling and analysis, previous works mostly ignore networks with temporal behavior and multi-modal actor roles. Further

  • NaturalMotion: Exploring Gesture Controls for Visualizing Time-Evolving Graphs

    سند علمی۲۰۱۶Samuel Clarke, Nathan Dass, Duen Horng, Chau

    We are investigating new ways for people to explore time-evolving graph data represented as the recently-introduced Matrix Cube, through natural gestures in a 3D environment. In the cube, one axis is time, and the other two axes comprise an adjacency matrix of a graph. We want to

  • Dynamic Stochastic Blockmodels: Statistical Models for Time-Evolving Networks

    سند علمی۲۰۱۳SBPKevin S. Xu, Alfred O. Hero

    Significant efforts have gone into the development of statistical models for analyzing data in the form of networks, such as social networks. Most existing work has focused on modeling static networks, which represent either a single time snapshot or an aggregate view over time.

  • Improving Community Detection in Time-Evolving Networks Through Clustering Fusion

    سند علمی۲۰۱۶Ran Jin, Chunhai Kou, Ruijuan Liu

    Traditional community detection algorithms are easily interfered by noises and outliers. Therefore, we propose to leverage a clustering fusion method to improve the results of community detection. Usually, there are two issues in clustering ensembles: how to generate efficient di