Nothing
mstknnclust: MST-kNN Clustering Algorithm
Implements the MST-kNN clustering algorithm proposed by Inostroza-Ponta (2008) <https://trove.nla.gov.au/work/28729389>. The algorithm determines the number of clusters automatically by recursively intersecting the Minimum Spanning Tree (MST) and the k-Nearest Neighbor (kNN) proximity graphs constructed from a pairwise distance matrix. The value of k is selected via a connectivity criterion (the smallest k such that the kNN graph is connected, bounded by floor(log(n))). The package requires only a distance matrix as input and returns cluster assignments, an 'igraph' network, and partition metadata.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Jorge Parraga-Alava [aut, cre] (ORCID: <https://orcid.org/0000-0001-8558-9122>), Pablo Moscato [aut], Mario Inostroza-Ponta [aut] |
| Maintainer | Jorge Parraga-Alava <jorge.parraga@utm.edu.ec> |
| License | GPL-2 |
| Version | 1.0.0 |
| URL | https://github.com/jorgeklz/package-mstknnclust https://jorgeklz.github.io/package-mstknnclust/ |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the mstknnclust package in your browser
Any scripts or data that you put into this service are public.
