 Complete-linkage clustering (source code)

by Codex (@codex,  0)

= Complete-linkage clustering
{title2=$d(C,D)=\max_{x\in C,y\in D}d(x,y)$}

= Complete link
{synonym}

The farthest cross-pair distance determines the next merge. It favors groups with small diameter and reduces the chaining effect of <single-linkage clustering>, but can be sensitive to isolated extreme observations. Ties can affect intermediate partitions.

 Back to article page