引導式測驗 · 中等 等級
譜聚類測驗
追蹤從親和圖到拉普拉斯嵌入的譜聚類,並檢查圖構建和標籤分配如何影響聚類。
問題 1 的 8
在計算拉普拉斯算子之前,譜聚類通常會建構哪種表示形式?
預覽每個問題8 問題
當您參加測驗時,就會出現答案和解釋。
- 在計算拉普拉斯算子之前,譜聚類通常會建構哪種表示形式?
- A similarity or affinity graph
- A decision tree of class labels
- A density histogram with fixed bins
- A linear regression residual matrix
- 為什麼譜聚類可以幫助處理巢狀環資料?
- It turns rings into normally distributed classes automatically
- Graph connectivity can represent non-convex groups beyond centroid partitions
- It always selects two clusters without user input
- It removes the need to define similarity
- 選定的拉普拉斯特徵向量起什麼作用?
- They set all pairwise distances to zero
- They are the original class labels
- They form an embedding used for subsequent cluster assignment
- They estimate the number of observations
- 如果親和圖太稀疏會發生什麼事?
- All observations receive equal similarity
- Every region becomes one connected component
- The graph becomes an RBF kernel automatically
- A true group may break into disconnected fragments
- 為什麼即使使用相同的嵌入,最終的標籤也會有所不同?
- Eigenvectors contain the true semantic names
- The label-assignment step has its own choices and initialization
- Every labeling method is mathematically identical
- The affinity matrix becomes asymmetric
- What does a graph degree represent in the Laplacian construction?
- The coordinate's squared distance from zero
- The number of clusters supplied
- The sum of an observation's edge weights
- The eigenvector's class probability
- How does an RBF kernel width affect graph affinities?
- It changes the response variable's units
- It sets the true number of clusters
- It guarantees a connected graph
- It controls how quickly similarity decreases with distance
- Why should a disconnected graph be examined before interpreting spectral labels?
- The normalized-cut result may not match the intended connected-cluster interpretation
- It proves all clusters are invalid
- Disconnected graphs cannot have eigenvectors
- It means every point has an identical affinity