= Agglomerative clustering of nonmetric dissimilarities
The min and max cross-pair definitions of <single-linkage clustering> and <complete-linkage clustering> remain meaningful for a symmetric nonnegative <dissimilarity matrix> that violates the triangle inequality. Such a calculation gives a valid algorithmic dendrogram, but does not turn the original matrix into Euclidean distances. A triangle-inequality counterexample identifies that source defect without requiring invented replacement data.
Back to article page
