The process shows, using the Maximum Variance (R15) dataset, how divisive hierarchical cluster analysis can be done.
The dataset contains 600 two-dimensional vectors, which form 15 separate groups. The task is to define the ideal cardinality of the groups, and to discover them.
In order to perform divisive clustering, an arbitrary clustering method with which the division can be performed is necessary. In the initial state, all points belong to the same cluster, then, the method continuously divides the points into multiple groups, until finally, all points are placed into separate clusters. The operator determines the ideal number of clusters, and assigns the points to the clusters as well.
In the present case, the procedure determined the number of cluster as 63 groups.
Then the points are assigned to these groups.
It can be seen that indeed, the method has created a larger number of clusters, but due to this, the central clusters can be separated better from each other.