Hierarchical clustering is a general family of clustering algorithms that build nested clusters by merging them successively using the so-called "Ward's method". This hierarchy of clusters represented as a tree (or
dendrogram). The root of the tree is the unique cluster that gathers all the samples, the leaves being the clusters with only one sample.