Of Notes

K-Means Clustering, Silhouette Index, and GMM

1 min read · revised 22 October 2026 · ·

Table of Contents

Problem

You measured the following data points:

(a) [5 marks] Using the Euclidean distance in and the starting representatives , you are asked to consider the K-means clustering with . How many iterations will be required for the 2-means algorithm to converge and what is the final clustering assignment? (b) [5 marks] Show that the 2-means algorithm would return a different clustering assignment for other choices of the starting representatives. (c) [8 marks] Using two clustering assignments obtained at point (a) and (b) from different starting representatives, compute the silhouette index for the point . Comment on how well the two assignments are clustering this point. (d) [7 marks] Define a Gaussian mixture model to cluster the inputs above in clusters. Describe one advantage of this approach over the K-means (for a generic sample, not necessarily the one considered in this question).

Solution

/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card