When performing hierarchical clustering, which linkage method considers the maximum distance between points in two clusters?

Question

BlackTom AI · Accepted Answer

When evaluating how hierarchical clustering decides which clusters to merge next, it's important to match the linkage rule to the distance measure used between clusters.
Option 1: Single Linkage. This method defines the inter-cluster distance as the minimum distance between any pair of points from the two clusters. It tends to create elongated, chain-like clusters and is sensitive to outliers. This is not the same as using the maximum pairwise distance.
Option 2: Complete Linkage. This approach defines the inter-cluster distance as the maximum distance between any pair of points, one from each cluster. It tends to produce more compact and spherical clusters because the worst-case (largest) separation governs the merge decision, which aligns with the description in the question.
Option 3: Average Linkage. Here, the distance between clusters is the average of all pairwise distances between points in the two clusters. While it smooths out extremes, it does not focus on the maximum distance, so the question’s criterion is not about the average case.
Option 4: Ward's Method. Ward's criterion merges clusters based on the increasing of the within-cluster sum of squares, effectively aiming to minimize total variance; it is not defined by a simple maximum between-point distance and thus does not match the stated criterion.
In summary, the statement matches Complete Linkage, which uses the maximum pairwise distance between points across the two clusters to determine mergers, unlike the other linkage strategies described above.

When performing hierarchical clustering, which linkage method considers the maximum distance between points in two clusters?单项选择题

类似问题

What is the main concept behind hierarchical clustering?

Which of the following is an advantage of hierarchical clustering over k-Means clustering?

What is a dendrogram?

If a dendrogram shows two main branches that merge at a very high distance (height) on the vertical axis, what does this suggest?

Which rule defines the "Complete Linkage" method in Hierarchical clustering?

In an agglomerative hierarchical clustering dendrogram, how do you determine the number of clusters by "cutting" the tree?

Which of the following is finally produced by hierarchical clustering?

Hierarchical clustering differs from K-means clustering in that:

更多留学生实用工具

智能学习助手

风格化写作助手

论文查重助手

文献引用助手

课堂转译助手

课堂笔记助手

Quiz搜索助手

学校历年真题

智能刷题助手

智能匹配练习

希望你的学习变得更简单