引導式測驗 · 中等 等級
層次聚類測驗
讀取樹狀圖高度,區分連結規則並了解縮放和剪切選擇如何影響層次聚類結果。
問題 1 的 8
凝聚層次聚類建構什麼序列?
預覽每個問題8 問題
當您參加測驗時,就會出現答案和解釋。
- 凝聚層次聚類建構什麼序列?
- Repeated cluster merges from individual observations toward larger groups
- Repeatedly split one cluster into smaller groups from the top down
- Assign each point to a fixed centroid and update those centroids
- Join each point to its nearest neighbor once without building nested groups
- Which rule defines single linkage between two clusters?
- The maximum pairwise distance across clusters
- The minimum pairwise distance across clusters
- The average of all pairwise distances
- The increase in within-cluster sum of squares
- 哪個連桿使用最遠的跨簇對?
- Average linkage
- Single linkage
- Complete linkage
- Ward linkage
- 樹狀圖合併高度編碼什麼?
- The p-value for a test that the two groups differ
- The number of observations contained in the merged branch
- The proportion of observations assigned to the left child
- The linkage distance or criterion value at that merge
- 為什麼樹狀圖高度的大幅躍升會有用?
- It proves the exact number of natural populations
- It may suggest candidate cuts that keep separated branches apart
- It means every leaf is an outlier
- It identifies the optimal feature scaling
- 為什麼單一連結可以建立連結模式?
- It requires all points to be equally distant
- It uses the average distance between every pair
- A sequence of near neighbors can connect otherwise elongated groups
- It minimizes centroid variance
- What does Ward linkage seek to minimize when merging?
- The entropy of labels
- The largest single pairwise distance only
- The number of leaves in the tree
- The increase in within-cluster sum of squares
- Why standardize features before Euclidean hierarchical clustering when units vary greatly?
- Otherwise a large-scale feature can dominate distances
- Scaling changes the dendrogram into a supervised model
- It forces average linkage to equal Ward linkage
- It guarantees that the chosen cut is stable