Which of the following is finally produced by hierarchical clustering?

Question

BlackTom AI · Accepted Answer

Hierarchical clustering builds a dendrogram that records the sequence and distances of merges (or splits), so the final product is a tree-like diagram showing how close items are to each other.

1) Relevant concepts
- Hierarchical clustering: either agglomerative (bottom-up) or divisive (top-down).  
- Distance matrix D between all items; linkage rules (single, complete, average, Ward) that define inter-cluster distance.  
- Dendrogram: a binary tree where leaves are individual observations and internal nodes show merges/splits at particular distance levels.

2) Step-by-step reasoning process
- Start with n singleton clusters. Compute the n×n distance matrix D where D(i,j) = distance(x_i,x_j).  
- Agglomerative step: find the pair (A,B) with minimum inter-cluster distance according to chosen linkage, merge them into a new cluster C. Record the merge and the distance value at which they merged.  
- Update the distance matrix using the linkage formula (examples below). Repeat until one cluster remains. Each merge is one level of the tree; after (n−1) merges you have a complete hierarchical clustering.
- The sequence of merges and their distances are plotted as a dendrogram: leaves at the bottom, internal nodes at heights equal to merge distances, branches showing cluster membership across levels.

3) Intermediate formulas (examples)
- Single-linkage update: d(C, X) = min(d(A, X), d(B, X))  
- Complete-linkage: d(C, X) = max(d(A, X), d(B, X))  
- Average-linkage: d(C, X) = (|A| d(A,X) + |B| d(B,X)) / (|A|+|B|)  
These updates are applied iteratively for n−1 merges, and every merge is stored for the dendrogram.

4) Why the correct answer is correct
The dendrogram explicitly shows how “close” items/clusters are (the height of merges equals inter-cluster distance). Hierarchical clustering’s canonical output is this dendrogram; it encapsulates all possible clusterings at every cut level.

5) Why other options are incorrect
- “Final estimate of cluster centroids”: centroids are typical of k-means; hierarchical methods do not inherently produce centroid estimates (unless you cut the tree and compute centroids afterward).  
- “Assignment of each point to clusters”: you get assignments only after cutting the dendrogram at a chosen height or number of clusters; the method’s native output is the dendrogram, not a single fixed assignment.  
- “none of these”: incorrect because the dendrogram option exactly matches the standard output.

6) Conclusion
The correct final product of hierarchical clustering is a dendrogram showing how close things are to each other, which matches the provided answer.

Which of the following is finally produced by hierarchical clustering?单项选择题

类似问题

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?

Hierarchical clustering differs from K-means clustering in that:

更多留学生实用工具

智能学习助手

风格化写作助手

论文查重助手

文献引用助手

课堂转译助手

课堂笔记助手

Quiz搜索助手

学校历年真题

智能刷题助手

智能匹配练习

希望你的学习变得更简单