Clustering Large Datasets by Merging K-Means Solutions
![[R logo]](../../../doc/html/Rlogo.svg)
![[Up]](../../../doc/html/left.jpg)
![[Top]](../../../doc/html/up.jpg)
Documentation for package ‘MergeKmeans’ version 0.2.0
Help Pages
| augment.MergeKmeans | Broom tidiers for MergeKmeans fits |
| chooseK | Choose the number of K-means components |
| glance.MergeKmeans | Broom tidiers for MergeKmeans fits |
| MergeKmeans | Clustering by merging K-means solutions (DEMP-K) |
| MergeKmeans-tidiers | Broom tidiers for MergeKmeans fits |
| overlap_map | Overlap map display |
| pairwise_overlap | Pairwise overlap between Gaussian components |
| plot.MergeKmeans | Plot method for MergeKmeans fits |
| predict.MergeKmeans | Predict cluster membership for new observations |
| recut | Re-cut the merge tree of a MergeKmeans fit |
| summary.MergeKmeans | Summary method for MergeKmeans fits |
| tidy.MergeKmeans | Broom tidiers for MergeKmeans fits |