Construct and Visualize TDA Mapper Graphs


[Up] [Top]

Documentation for package ‘mappeR’ version 1.1.0

Help Pages

check_in_interval Get a tester function for an interval.
compute_tightness Compute dispersion of a single cluster
convert_to_clusters The easiest clustering method
create_1D_mapper_object Run 1D mapper
create_balls Make a cover of balls
create_ball_mapper_object Run mapper using a trivial filter, a cover of balls, and no clustering algorithm.
create_bins Create bins of data
create_clusterball_mapper_object Run clusterball mapper
create_mapper_object Create a mapper object
create_single_bin Create a bin of data
create_width_balanced_cover Generate an overlapping cover of an interval
cut_dendrogram Cut a dendrogram
eccentricity_filter Compute eccentricity of data points
get_bin_vector Recover bins
get_clustered_data Get data within a cluster
get_clusters Initate the clustering process
get_cluster_sizes Compute cluster sizes
get_cluster_tightness_vector Compute dispersion measures of a list of clusters
get_edgelist_from_overlaps Obtain edge list from cluster intersections
get_edge_weights Calculate edge weights
get_overlaps Get cluster overlaps
get_single_linkage_clusters Perform single linkage clustering and process dendrograms
get_tallest_branch Find the tallest branch of a dendrogram
is_in_ball Get a tester function for a ball.
mapper_object_to_igraph make igraph
next_triangular Find which triangular number you're on
process_dendrograms Cut many dendrograms
run_cluster_machine Ship data off to the clustering goblins
run_mapper Construct mapper graph from data
run_slink Perform single linkage clustering
subset_dists Subset a distance matrix