Computes the “agglomerative coefficient” (aka “divisive
coefficient” for diana
), measuring the
clustering structure of the dataset.
For each observation i, denote by \(m(i)\) its dissimilarity to the
first cluster it is merged with, divided by the dissimilarity of the
merger in the final step of the algorithm. The agglomerative
coefficient is the average of all \(1 - m(i)\). It can also be seen
as the average width (or the percentage filled) of the banner plot.
coefHier()
directly interfaces to the underlying C code, and
“proves” that only object$heights
is needed to
compute the coefficient.
Because it grows with the number of observations, this measure should not
be used to compare datasets of very different sizes.