Question: Q 5 . Clustering ( Total 1 0 pt ) Consider the following set of one - dimensional data points: ( { 0
Q Clustering Total pt
Consider the following set of onedimensional data points:
All the points are located in the range between
apt Suppose we apply kmeans clustering to obtain three clusters, A B and C If the initial centroids are located at respectively, we have the following cluster assignment of the data points.
begintabularccccccccccc
hline multirow Iter & multicolumnc Cluster assignment of data points & multicolumnc Centroid Locations
cline & & & & & & & A & B & C
hline & A & B & B & B & C & C & & &
hline & A & A & B & B & C & C & & &
hline & A & A & B & B & C & C & & &
hline & A & A & B & B & C & C & & &
hline
endtabular
Find the sumofsquared errors SSE of the clustering after the third iteration. And find the silhouette coefficient of data point after the third iteration.
bpt For the dataset given in part a is it possible to obtain empty clusters? Why?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
