Construct and Visualize TDA Mapper Graphs
Construct mapper graph from data
Get a tester function for an interval.
Compute dispersion of a single cluster
"Clustering" for ballmapper just means treating each bin as its own cl...
Run 1D mapper
Run mapper using a trivial filter, a cover of balls, and no clustering...
Make a cover of balls
Create bins of data
Run clusterball mapper
Create a mapper object
Create a bin of data
Generate an overlapping cover of an interval
Cut a dendrogram in context
Compute eccentricity of data points
Recover bins
Compute cluster sizes
Compute dispersion measures of a list of clusters
Get data within a cluster
Perform the clustering step in mapper
Calculate edge weights
Obtain edge list from cluster intersections
Perform single-linkage hierarchical clustering and process dendrograms...
Get cluster overlaps
Ship data off to the clustering goblins
Find the tallest branch of a dendrogram
Create a little dude to perform hierarchical clustering in a semi-glob...
Get a tester function for a ball.
make igraph
mappeR: Construct and Visualize TDA Mapper Graphs
Find which triangular number you're on
Cut many dendrograms in context
Perform agglomerative clustering on a single distance matrix.
Subset a distance matrix
Topological data analysis (TDA) is a method of data analysis that uses techniques from topology to analyze high-dimensional data. Here we implement Mapper, an algorithm from this area developed by Singh, Mémoli and Carlsson (2007) which generalizes the concept of a Reeb graph <https://en.wikipedia.org/wiki/Reeb_graph>.
Useful links