Question: Q 5 . Clustering ( Total 1 0 pt ) Consider the following set of one - dimensional data points: ( { 0

Q5. Clustering (Total 10pt)
Consider the following set of one-dimensional data points: \(\{0.1,0.25,0.45,0.55,0.8,0.9\}\).
All the points are located in the range between \([0,1]\).
(a)(8pt) Suppose we apply k-means clustering to obtain three clusters, A, B, and C. If the initial centroids are located at \(\{0,0.4,1\}\), respectively, we have the following cluster assignment of the data points.
\begin{tabular}{|c|c|c|c|c|c|c|c|c|c|c|}
\hline \multirow{2}{*}{ Iter } & \multicolumn{4}{|c|}{ Cluster assignment of data points } & \multicolumn{3}{|c|}{ Centroid Locations }\\
\cline {2-10} & 0.10 & 0.25 & 0.45 & 0.55 & 0.80 & 0.90 & A & B & C \\
\hline 0 & A & B & B & B & C & C & 0.00 & 0.40 & 1.00\\
\hline 1 & A & A & B & B & C & C & 0.1 & 0.42 & 0.85\\
\hline 2 & A & A & B & B & C & C & 0.18 & 0.5 & 0.85\\
\hline 3 & A & A & B & B & C & C & 0.18 & 0.5 & 0.85\\
\hline
\end{tabular}
Find the sum-of-squared errors (SSE) of the clustering after the third iteration. And find the silhouette coefficient of data point 0.25 after the third iteration.
(b)(2pt) For the dataset given in part (a), is it possible to obtain empty clusters? Why?
Q 5 . Clustering ( Total 1 0 pt ) Consider the

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!