Every Euclidean distance obeys the triangle inequality. The three recorded entries , and violate it:At least one of must be incorrect. Two are in the final row as required. The gap is far larger than any possible rounding of entries to two decimal places.
Complete-linkage clustering defines the dissimilarity between clusters in cluster analysis as . Remove point 6 and first merge 1 with 4 at height . The distances from to 2, 3, 5 are respectivelyThe next merge therefore attaches 2 at . Now the distances from to 3 and 5 are and , whereas . Merge 3 and 5 at . The final distance between the two remaining clusters in cluster analysis is the largest cross-entry, . Thus the dendrogram has merges
Cutting strictly between heights and gives the two clusters in cluster analysisThe figure is an original drawing of these computed merges.
Articles by others on the same topic
There are currently no matching articles.
