get_hierarchical_clusters

Perform hierarchical clustering and process dendrograms.

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

George Clare Kennedy

mappeR

Construct and Visualize TDA Mapper Graphs

get_hierarchical_clusters function

<dl><dt>dist_mats</dt>
<dd>A list of distance matrices to be used for clustering.</dd>
<dt>method</dt>
<dd>A string to pass to <a href="/link/hclust?package=mappeR&version=2.1.0" data-mini-rdoc="mappeR::hclust">hclust</a> to tell it what kind of clustering to do.</dd>
<dt>cut_height</dt>
<dd>A global cut height. If not specified or negative, dendrograms will be cut individually.</dd></dl>

Arguments

Perform hierarchical clustering and process dendrograms. — get_hierarchical_clusters

<dl>

<dt>dist_mats</dt>
<dd>A list of distance matrices to be used for clustering.</dd>


<dt>method</dt>
<dd>A string to pass to <a href='https://rdrr.io/r/stats/hclust.html'>hclust</a> to tell it what kind of clustering to do.</dd>


<dt>cut_height</dt>
<dd>A global cut height. If not specified or negative, dendrograms will be cut individually.</dd>

</dl>

get_hierarchical_clusters: Perform hierarchical clustering and process dendrograms.

Description

Usage

Value

Arguments