Award Abstract # 1513616
III: Medium: Collaborative Research: Topological Data Analysis for Large Network Visualization

NSF Org: IIS
Division of Information & Intelligent Systems
Recipient: UNIVERSITY OF UTAH
Initial Amendment Date: August 27, 2015
Latest Amendment Date: November 2, 2018
Award Number: 1513616
Award Instrument: Standard Grant
Program Manager: Hector Munoz-Avila
IIS
 Division of Information & Intelligent Systems
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: September 1, 2015
End Date: August 31, 2020 (Estimated)
Total Intended Award Amount: $761,067.00
Total Awarded Amount to Date: $793,089.00
Funds Obligated to Date: FY 2015 = $761,067.00
FY 2016 = $16,302.00

FY 2019 = $15,720.00
History of Investigator:
  • Bei Phillips (Principal Investigator)
    beiwang@sci.utah.edu
  • Paul Rosen (Co-Principal Investigator)
Recipient Sponsored Research Office: University of Utah
201 PRESIDENTS CIR
SALT LAKE CITY
UT  US  84112-9049
(801)581-6903
Sponsor Congressional District: 01
Primary Place of Performance: University of Utah
72 S Central Campus Dr
Salt Lake City
UT  US  84112-9200
Primary Place of Performance
Congressional District:
01
Unique Entity Identifier (UEI): LL8GLEVH6MG3
Parent UEI:
NSF Program(s): Info Integration & Informatics,
Algorithmic Foundations
Primary Program Source: 01001516DB NSF RESEARCH & RELATED ACTIVIT
01001617DB NSF RESEARCH & RELATED ACTIVIT

01001920DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7364, 7924, 7929, 9150, 9251
Program Element Code(s): 736400, 779600
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

This project leverages topological methods to develop a new class of data analysis and visualization techniques to understand the structure of networks. Networks are often used in modeling social, biological and technological systems, and capturing relationships among individuals, businesses, and genomic entities. Understanding such large, complex data sources is highly relevant and important in application areas including brain connectomics, epidemiology, law enforcement, public policy and marketing. The proposed research will be evaluated over multiple data sources, including but not limited to large social, communication and brain network datasets. Furthermore, the new approaches developed in this project will be integrated into growing data analysis curricula, shared through developing workshops, and used as topics to continue attracting underrepresented groups into STEM fields and computer science specifically.

The scientific challenges this project addresses are two-fold: how to use topology to extract features from the data; and how to design effective visualizations to communicate these features to domain experts and decision makers. Topological techniques central to this project provide a strong theoretical basis for simplifying and summarizing complex data while still preserving critical underlying structures. They also provide a basis for task-oriented designs that allow us to control the volume of data to be displayed in visualizations, so users can develop faithful mental models of the data, facilitating information discovery. This project focuses on two research agendas. First, it proposes a rich body of topological summarization techniques to extract and preserve important topological features within large-scale graph-structured networks, and to obtain compact and hierarchical representations that are suitable for visual exploration. The feature extracting process captures complex interactions in the system, describes features at all scales, is robust with respect to noise, and has efficient computation. Second, this project proposes designing visualizations that encode the extracted topological structures explicitly, focusing on investigating techniques to fully exploit their properties in the visual metaphors to be developed. The project web site (http://www.sci.utah.edu/networktdav) provides additional information and will include access to developed tools and test data sets.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 50)
Adam Brown, Bei Wang "Sheaf-Theoretic Stratification Learning" 34th International Symposium on Computational Geometry (SOCG) , v.99 , 2018 10.4230/LIPIcs.SoCG.2018.14
Adam Brown, Bei Wang "Sheaf-Theoretic Stratification Learning From Geometric and Topological Perspectives" Discrete & Computational Geometry , 2020 10.1007/s00454-020-00206-y
Adam Brown, Omer Bobrowski, Elizabeth Munch, Bei Wang "Probabilistic Convergence and Stability of Random Mapper Graphs" Journal of Applied and Computational Topology , 2020 10.1007/s41468-020-00063-x
Alejandro Robles, Mustafa Hajij, Paul Rosen "The Shape of an Image: A Study of Mapper on Images" 13th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications , 2018
Ashley Suh, Christopher Salgado, Mustafa Hajij, Paul Rosen "TopoLines: Topological Smoothing for Line Charts" EG/VGTC Conference on Visualization Short Paper , 2020 10.2312/evs.20201053
Ashley Suh, Mustafa Hajij, Bei Wang, Carlos Scheidegger, Paul Rosen "Persistent Homology Guided Force-Directed Graph Layouts" IEEE Transactions on Visualization and Computer Graphics , v.26 , 2020 , p.697-707 10.1109/TVCG.2019.2934802
Athawale, Tushar and Maljovec, Dan and Yan, Lin and Johnson, Christopher and Pascucci, Valerio and Wang, Bei "Uncertainty Visualization of 2D Morse Complex Ensembles Using Statistical Summary Maps" IEEE Transactions on Visualization and Computer Graphics , 2020 https://doi.org/10.1109/TVCG.2020.3022359 Citation Details
Braxton Osting, Sourabh Palande, Bei Wang. "Towards Spectral Sparsification of Simplicial Complexes Based on Generalized Effective Resistance" Journal of Computational Geometry , v.11 , 2020 , p.176-211 1920-180X
Brittany T. Fasy and Bei Wang "Exploring Persistent Local Homology in Topological Data Analysis" IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , 2016 10.1109/ICASSP.2016.7472915
Brown, Adam and Wang, Bei "Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives" Discrete & Computational Geometry , 2020 10.1007/s00454-020-00206-y Citation Details
Catanzaro, Michael J. and Curry, Justin M. and Fasy, Brittany Terese and Lazovskis, Jnis and Malen, Greg and Riess, Hans and Wang, Bei and Zabka, Matthew "Moduli spaces of morse functions for persistence" Journal of Applied and Computational Topology , 2020 10.1007/s41468-020-00055-x Citation Details
(Showing: 1 - 10 of 50)

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

Networks are often used to model social, biological and technological systems. The challenges in visualizing large networks are two-fold: how to perform effective analysis that extract features from the complex network data; and how to design effective visualizations to communicate these features to the users. This project has addressed these challenges by leveraging topological data analysis to develop visualizations for large network data. In particular, this project has introduced a rich body of topological summarization techniques to simplify large-scale networks into compact representations, and provided interactive visualizations for users exploring such data. This project has built new tools for the analysis and visualization of network data by linking their topological profiles with interactive visualization. The contributions include using persistent homology to guide force-directed graph layouts, constructing topological summary graphs to explore activations from neural networks, visualizing infrastructure networks such as interdependent electric bus transit and power distribution systems for smart cities, and efficient computation of topological descriptors. This project has broadened the applications of topological data analysis in network visualization. The results of the project have been disseminated to multiple research communities via publications and presentations, in Mathematics, Computer Science, Neuroscience, Electrical and Computer Engineering, and Biochemistry. In total, the project has produced 2 best papers, 14 journal publications, 17 conference publications, 2 book chapters, and 6 software tools. All software tools are open source and publicly available, including an interactive tool for the automated exploration and contextualization of metabolic networks, and a tool that implements persistent homology guided force-directed graph layout. The project has also created training opportunities for a number of students, including students from underrepresented groups. It has also led to two Dagstuhl Seminars titled "Topology, Computation and Data Analysis" that facilitate interactions among data theorists and data practitioners from several communities to address challenges in computational topology, topological data analysis, and topological visualization. Two undergraduate students have won prestigious awards, an  Honorable Mention and a Finalist among the Computing Research Association (CRA) Outstanding Undergraduate Researchers, respectively.

 


Last Modified: 01/05/2021
Modified by: Bei W Phillips

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page