Skip to content
Prev 359349 / 398503 Next

merge small clusters in R

This is not a well defined question, until your notions of "small" and "nearest" are defined. In your specific example

   rect.hclust(hc, k = 3, border = 2:5)

... will do what you are asking for. This is not likely to work in the general case - imagine that your cluster of size two only meets the others at the root: in that case you would be distorting the result significantly if you were to merge it in with another cluster, simply based on membership size. That said, perhaps the package dynamicTreeCut will help you find cuts in a dendrogram that more closely match your intuition.

B.
On Mar 16, 2016, at 11:38 AM, Sheila the angel <from.d.putto at gmail.com> wrote: