Implements a minimum-spanning-tree-based heuristic for k-means clustering using a union-find disjoint set and the algorithm in Kruskal (1956) .
It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.
1.0.0.0 by Kevin Michael Frick, 5 years ago
Browse source code at https://github.com/cran/mstclustering
Authors: Kevin Michael Frick <[email protected]>
Documentation: PDF Manual
AGPL (>= 3) license
Imports reshape2, data.table
See at CRAN