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 DOI: 10.32614/CRAN.package.mstclustering Author: Kevin Michael Frick Maintainer: Kevin Michael Frick <kmfrick98 at gmail.com> License: AGPL (≥ 3) NeedsCompilation: no CRAN checks: mstclustering results Documentation: Reference manual: mstclustering.pdf Downloads: 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 Linking:Please use the canonical form https://CRAN.R-project.org/package=mstclustering to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4