Implements a minimum-spanning-tree-based heuristic for k-means clustering using a union-find disjoint set and the algorithm in Kruskal (1956) <doi:10.1090/S0002-9939-1956-0078686-7>.
| Version: | 1.0.0.0 |
| Depends: | R (≥ 4.1.0) |
| Imports: | reshape2, data.table |
| Published: | 2022-02-08 |
| Author: | Kevin Michael Frick |
| Maintainer: | Kevin Michael Frick <kmfrick98 at gmail.com> |
| License: | AGPL (≥ 3) |
| NeedsCompilation: | no |
| CRAN checks: | mstclustering results |
| Reference manual: | mstclustering.pdf |
| Package source: | mstclustering_1.0.0.0.tar.gz |
| Windows binaries: | r-devel: mstclustering_1.0.0.0.zip, r-release: mstclustering_1.0.0.0.zip, r-oldrel: mstclustering_1.0.0.0.zip |
| macOS binaries: | r-release (arm64): mstclustering_1.0.0.0.tgz, r-oldrel (arm64): mstclustering_1.0.0.0.tgz, r-release (x86_64): mstclustering_1.0.0.0.tgz, r-oldrel (x86_64): mstclustering_1.0.0.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=mstclustering to link to this page.