generate.intersections.mst.knn

This function performs a graph partition based on the intersection of the edges of two proximity graphs: MST and kNN.

internal

Implements the MST-kNN clustering algorithm which was proposed by Inostroza-Ponta, M. (2008) <https://trove.nla.gov.au/work/28729389?selectedversion=NBD44634158>.

Jorge Parraga-Alava 

mstknnclust

MST-kNN Clustering Algorithm

Pablo Moscato 

Mario Inostroza-Ponta 

generate.intersections.mst.knn function

<dl><dt>nodes.list</dt>
<dd>A vector with a subset of objects (nodes) of the data matrix for which the MST y kNN graphs must be generated.</dd>
<dt>distance.matrix</dt>
<dd>A distance matrix between each pair of elements in <code>nodes.list</code>. It is used as the edges costs to generate MST y kNN graphs.</dd>
<dt>suggested.k</dt>
<dd>A numeric value representing the number of nearest neighbors to consider to generate the kNN graph.</dd></dl>

Arguments

Mario Inostroza-Ponta, Jorge Parraga-Alava, Pablo Moscato

Author

Performs the intersections between MST y kNN graphs — generate.intersections.mst.knn

<dl>

<dt>nodes.list</dt>
<dd>A vector with a subset of objects (nodes) of the data matrix for which the MST y kNN graphs must be generated.</dd>


<dt>distance.matrix</dt>
<dd>A distance matrix between each pair of elements in <code>nodes.list</code>. It is used as the edges costs to generate MST y kNN graphs.</dd>


<dt>suggested.k</dt>
<dd>A numeric value representing the number of nearest neighbors to consider to generate the kNN graph.</dd>

</dl>

generate.intersections.mst.knn: Performs the intersections between MST y kNN graphs

Description

Usage

Value

Arguments

Author