Can we define a data partitioning in K clusters, by cutting the branches of the tree at some levels in the tree below the root node?

Assume we have a dendogram (hierarchical clusterisation tree), can we define a data partitioning in K clusters, by cutting the branches of the tree at some levels in the tree below the root node?

Topic hierarchical-data-format clustering

Category Data Science

1
answered at

Yes absolutely, in fact that's exactly how one obtains actual clusters with hierarchical clustering.

With hierarchical clustering it's possible to decide the number of clusters (i.e. the level of "precision") after obtaining the tree (dendogram).

About

Geeks Mental is a community that publishes articles and tutorials about Web, Android, Data Science, new techniques and Linux security.