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.
| Version: | 1.0.0 |
| Depends: | R (≥ 3.5.0) |
| Imports: | igraph |
| Suggests: | knitr, rmarkdown, testthat (≥ 3.0.0) |
| Published: | 2026-05-13 |
| DOI: | 10.32614/CRAN.package.mstknnclust |
| Author: | Jorge Parraga-Alava
 [aut, cre],
Pablo Moscato [aut],
Mario Inostroza-Ponta [aut] |
| Maintainer: | Jorge Parraga-Alava <jorge.parraga at utm.edu.ec> |
| BugReports: | https://github.com/jorgeklz/package-mstknnclust/issues |
| License: | GPL-2 |
| URL: | https://github.com/jorgeklz/package-mstknnclust, https://jorgeklz.github.io/package-mstknnclust/ |
| NeedsCompilation: | no |
| Materials: | README, NEWS |
| CRAN checks: | mstknnclust results |
Documentation:
| Reference manual: | mstknnclust.html , mstknnclust.pdf |
| Vignettes: |
A quick guide of mstknnclust package (source, R code) |
Downloads:
| Package source: | mstknnclust_1.0.0.tar.gz |
| Windows binaries: | r-devel: mstknnclust_0.3.2.zip, r-release: mstknnclust_0.3.2.zip, r-oldrel: mstknnclust_0.3.2.zip |
| macOS binaries: | r-release (arm64): mstknnclust_0.3.2.tgz, r-oldrel (arm64): mstknnclust_0.3.2.tgz, r-release (x86_64): mstknnclust_0.3.2.tgz, r-oldrel (x86_64): mstknnclust_0.3.2.tgz |
| Old sources: | mstknnclust archive |
Reverse dependencies:
| Reverse suggests: | FCPS |
Linking:
Please use the canonical form https://CRAN.R-project.org/package=mstknnclust to link to this page.