gradiance.com/cru/servlet/COTC?Command-OpenHomework&isessionld-5016F6F38F7FC01BE
ID: 3603156 • Letter: G
Question
gradiance.com/cru/servlet/COTC?Command-OpenHomework&isessionld-5016F6F38F7FC01BE967A245270337CE; 1. The Bisecting k-Means algorithm starts by dividing the points into two clusters. It may consider several bisections and pick the best one. Let us take "best" to mean the lowest SSE (Sum Squared points of the cluster and the centroid of the cluster Suppose that the data set consists of nine points aranged in a square grid, as suggesed by the e SSE is defined to be the sum of the squares of the distances between each of the figure below Although it doesn't matter for this question, you may take the grid spacing to be 1 (ie., the squares are 2-by-2) and the lower-left corner to be the point (0,0). We see in the figure three possible bisections. (a) would be the bisection if we chose the two initial centroids to be 3 and 7, for example, and broke ties in favor of 7. (b) would be the split if we chose initial centroids 1 and 2. (c) would be the split for initial choice 2 and7 Compare these three options, and determine which is best. Then, pick the true statement from the list below a) (b) is a better choice than (c). b) (b) is a better choice than (a). c) (c) is the worst choice d) (a) is a better choice than (b). 2. Suppose that the true data consists of three clusters, as suggested by the diagram below archExplanation / Answer
1.
answer: b) (b) is a better choice than (a)
2.
answer: d) The probability that both A and C are correct is 19%
3.
answer: a) The probability that B union exactly equal to one of the apparent cluster is 2.4 %
4.
answer: b) yellow UL=(3,15) and LR=(13,7); Blue UL=(14,10) and LR=(23,6)
5.
answer: a) 9 and 81
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.