Multimapper: Data Density Sensitive Topological Visualization

  title={Multimapper: Data Density Sensitive Topological Visualization},
  author={Bishal Deb and Ankita Sarkar and Nupur Kumari and Akash Rupela and Piyush Kumar Gupta and Balaji Krishnamurthy},
  journal={2018 IEEE International Conference on Data Mining Workshops (ICDMW)},
Mapper is an algorithm that summarizes the topological information contained in a dataset and provides an insightful visualization. It takes as input a point cloud which is possibly high-dimensional, a filter function on it and an open cover on the range of the function. It returns the nerve simplicial complex of the pullback of the cover. Mapper can be considered a discrete approximation of the topological construct called Reeb space, as analysed in the 1-dimensional case by [Carri et al… 

Figures from this paper

ShapeVis: High-dimensional Data Visualization at Scale

ShapeVis is presented, a scalable visualization technique for point cloud data inspired from topological data analysis that captures the underlying geometric and topological structure of the data in a compressed graphical representation and demonstrates how it captures the structural characteristics of real and synthetic data sets.



Multiscale Mapper: Topological Summarization via Codomain Covers

A combinatorial version of the algorithm is presented that acts only on vertex sets connected by the 1-skeleton graph, and this algorithm approximates the exact persistence diagram thanks to a stability result that is shown to hold.

Convergence between Categorical Representations of Reeb Space and Mapper

Using tools from category theory, it is formally proved that the convergence between the Reeb space and mapper is proved in terms of an interleaving distance between their categorical representations.

Statistical Analysis and Parameter Selection for Mapper

It is shown that the Mapper is an optimal estimator of the Reeb graph, which gives, as a byproduct, a method to automatically tune its parameters and compute confidence regions on its topological features, such as its loops and flares.

Barcodes: The persistent topology of data

This article surveys recent work of Carlsson and collaborators on applications of computational algebraic topology to problems of feature detection and shape recognition in high-dimensional data. The

Topological Methods for the Analysis of High Dimensional Data Sets and 3D Object Recognition

The method, called Mapper, is based on the idea of partial clustering of the data guided by a set of functions defined on the data, and is not dependent on any particular clustering algorithm, i.e. any clustering algorithms may be used with Mapper.

Characterizing the Role of Environment on Phenotypic Traits using Topological Data Analysis

This work presents a new algorithmic framework to characterize the role of environment on phenotypic traits, an application of the Topological Data Analysis (TDA), which is an emerging branch in computational mathematics that deals with shapes and structures of complex data.

Introduction to Metric and Topological Spaces

Topological Dynamical SystemsIntroduction to TopologyIntroduction to Topological ManifoldsTopology for AnalysisTopologyConvex and Set-Valued AnalysisSet Theory and Metric SpacesA Primer on Hilbert

[Principal components analysis].

Only reduction data dimension could be justify the use of principal component analysis in identifying factors or components latent besides health indicators from Spanish regions, and its graphic output.

The topology of politics : voting connectivity in the US House of Representatives

Time-varying topological simplifications of the space of votes in the US House of Representatives (US HoR) display several interesting features unavailable with classical methods of machine learnin

Principal Components Analysis

Introduction Basic Concepts of Principal Components Geometrical Properties of Principal Components Decomposition Properties of Principal Components Principal Components of Patterned Correlation