Of Notes

Hierarchical Clustering and Gaussian Mixture Models

1 min read · revised 22 October 2026 · ·

Table of Contents

Problem

Consider the following measured inputs:

(a) [25 marks] Using the Euclidean distance in and complete linkage, draw the dendrogram for these inputs and comment on the possible clustering results based on visual inspection of the dendrogram. (b) [15 marks] Describe one advantage and one disadvantage of using the complete linkage with respect to the single linkage. (c) [25 marks] Define the within-cluster sum of squares and draw a sketch of the within-cluster sum of squares for the hierarchy of clusters obtained from the dendrogram (Exact values are not needed in the sketch but you must represent the order of magnitude correctly for each grouping). What is the best number of clusters based on this measure? (d) [15 marks] What different measure can you use to choose the number of clusters, if you are interested not only in the within-cluster variance but also in the separation between different clusters? Define this measure and explain how it can be used to select the best number of clusters. (e) [20 marks] Define a Gaussian mixture model to cluster the inputs above in clusters. Assuming you have estimated the parameters of this model, explain how you can assign each input to one of the clusters.

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