Hierarchical clustering algorithms build a dendrogram of nested clusters by repeatedly merging or splitting clusters.
The hclust function implements several classical algorithms for hierarchical
clustering (the algorithm to use is defined by the linkage parameter):
hclust
Hclust
Single-linkage clustering using distance matrix:
using Clustering
D = rand(1000, 1000);
D += D'; # symmetric distance matrix (optional)
result = hclust(D, linkage=:single)
The resulting dendrogram could be converted into disjoint clusters with the help
of cutree function.
cutree