activity
20172024
most citedSpectral Sparsification of Simplicial Complexes for Clustering and Label Propagation

5 citations · 10 across the 4 of their papers we have counts for

collaborators

5 papers

math.AT2024

Any Graph is a Mapper Graph

Enrique G Alvarado, Robin Belton, Kang-Ju Lee +4

The Mapper algorithm is a popular tool for visualization and data exploration in topological data analysis. We investigate an inverse problem for the Mapper algorithm: Given a data…

cs.LG2023★ 1 cited

G-Mapper: Learning a Cover in the Mapper Construction

Enrique Alvarado, Robin Belton, Emily Fischer +4

The Mapper algorithm is a visualization technique in topological data analysis (TDA) that outputs a graph reflecting the structure of a given dataset. However, the Mapper algorithm…

cs.CG2021★ 2 cited

Sketching Merge Trees for Scientific Data Visualization

Mingzhe Li, Sourabh Palande, Lin Yan +1

Merge trees are a type of topological descriptors that record the connectivity among the sublevel sets of scalar fields. They are among the most widely used topological tools in vi…

cs.CG2019★ 2 cited

TopoAct: Visually Exploring the Shape of Activations in Deep Learning

Archit Rathore, Nithin Chalapathi, Sourabh Palande +1

Deep neural networks such as GoogLeNet, ResNet, and BERT have achieved impressive performance in tasks such as image and text classification. To understand how such performance is…

cs.CG2017★ 5 cited

Spectral Sparsification of Simplicial Complexes for Clustering and Label Propagation

Braxton Osting, Sourabh Palande, Bei Wang

As a generalization of the use of graphs to describe pairwise interactions, simplicial complexes can be used to model higher-order interactions between three or more objects in com…