Questions 1-5 involve single link clustering algorithm for the data set with the
ID: 3836438 • Letter: Q
Question
Questions 1-5 involve single link clustering algorithm for the data set with the following four points: X_1 = [1, 2]^T, X_2 = [7, 4]^T, X_3 = [3, 1]^T, X_4 = [6, 3]^T. 1. Which is the initial proximity matrix P_o based on the Manhattan distance? (a) [0 4 21 4 0 10 21 10 0] (b) [0 5 6 5 0 7 6 7 0] (c) [0 8 3 6 8 0 7 2 3 7 0 5 6 2 5 0] (d) [0 11 52 11 0 40 52 40 0] The initial clustering solution is R_e = {(X_1), (X_2), (X_3), (X_4)} where each cluster has only one point. What is the next clustering solution R^2_3? (a) R_1 = {(X_1, X_2), (X_3), (X_4)} (b) R_1 {(X_1, X_4), (X_3), (X_2)} (c) R_1 = {(X_1), (X_3, X_3), (X_4)} (d) R_1 = {(X_3), (X_3), (X_3, X_4)} What is the next proximity matrix P_1 which shows distances between the clusters in R_2? (a) [0 3 6 3 0 5 6 5 0] (b) [0 9 1 9 0 2 1 2 0] (c) [0 5 12 5 0 5 12 5 0] (d)[0 4 8 4 0 12 8 12 0] What is the next clustering solution R_2? (a) R_2 = {(X_2, X_3), (X_1, X_4)} (b) R_3 = {(X_2, X)4), (X_1, X_3)} (c) R_2 = {(X_1), (X_3, X_2, X_4)} (d) R_3 = {(X_3, X_2, X_4), (X_3)} What is the next proximity matrix P_2 which shows distances between the clusters in R_2? (a) [0 9 9 0] (b) [0 5 5 0] (c) [0 8 8 0] (d) [0 11 11 0]Explanation / Answer
Involve single link algorithm clustering algorithm for the data set with the following four points.
1.option c
2.option a
3.option c
4..option b
5..option b
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.