mappeR1.3.0 package

Construct and Visualize TDA Mapper Graphs

Get a tester function for an interval.

Compute dispersion of a single cluster

The easiest clustering method

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

Compute eccentricity of data points

Recover bins

Compute cluster sizes

Compute dispersion measures of a list of clusters

Get data within a cluster

Initate the clustering process

Calculate edge weights

Obtain edge list from cluster intersections

Perform hierarchical clustering and process dendrograms

Get cluster overlaps

Find the tallest branch of a dendrogram

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

Ship data off to the clustering goblins

Perform single linkage clustering

Construct mapper graph from data

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>.

Maintainer: George Clare Kennedy License: MIT + file LICENSE Last published: 2024-10-30

Useful links