run_link

Perform agglomerative clustering on a single 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>.

George Clare Kennedy

mappeR

Construct and Visualize TDA Mapper Graphs

run_link function

<dl><dt>dist</dt>
<dd>A distance matrix.</dd>
<dt>method</dt>
<dd>A string to pass to <a href="/link/hclust?package=mappeR&version=2.0.2" data-mini-rdoc="mappeR::hclust">hclust</a> to determine clustering method.</dd></dl>

Arguments

Perform agglomerative clustering on a single distance matrix. — run_link

<dl>

<dt>dist</dt>
<dd>A distance matrix.</dd>


<dt>method</dt>
<dd>A string to pass to <a href='https://rdrr.io/r/stats/hclust.html'>hclust</a> to determine clustering method.</dd>

</dl>

run_link: Perform agglomerative clustering on a single distance matrix.

Description

Usage

Value

Arguments