MS-DS Master of Data science Master of Data science Unsupervised Machine Learning Models 1

Question 1

In hierarchical agglomerative clustering, which linkage criterion defines the distance between two clusters as the maximum distance between any two points in those clusters?

Accepted Answer

Complete linkage

Answer

Complete linkage (also called maximum linkage) measures the distance between two clusters as the distance between their two farthest-apart points. This tends to produce compact, roughly equal-sized clusters and is less sensitive to outliers than single linkage.

Question 2

Which of the following is NOT an assumption made by the K-Means clustering algorithm?

Accepted Answer

Clusters can have arbitrary non-convex shapes

Answer

K-Means assumes clusters are convex and isotropic (spherical), with similar variance and roughly equal size. It cannot naturally capture non-convex or irregularly shaped clusters — that is precisely one of its key limitations.

Question 3

When applying Principal Component Analysis (PCA), what property do the resulting principal components always satisfy?

Accepted Answer

They are orthogonal to one another

Answer

PCA decomposes the covariance matrix via eigendecomposition, producing eigenvectors (principal components) that are mathematically orthogonal — meaning they are uncorrelated with each other. This orthogonality is what makes PCA effective for removing redundant information.

Question 4

An autoencoder trained for dimensionality reduction consists of two main parts. What is the role of the bottleneck (latent) layer?

Accepted Answer

To force the network to learn a compressed representation of the input

Answer

The bottleneck layer has fewer neurons than the input, forcing the encoder to learn a compact, lower-dimensional latent representation. The reconstruction quality depends on how well this compressed code captures the essential structure of the data.

Question 5

Which evaluation metric for clustering does NOT require ground-truth labels to compute?

Accepted Answer

Davies-Bouldin Index

Answer

The Davies-Bouldin Index is an internal evaluation metric that measures the ratio of within-cluster scatter to between-cluster separation using only the data and cluster assignments — no ground-truth labels are needed. ARI, NMI, and homogeneity are all external metrics that require true labels.

MS-DS Master of Data science Practice Test

MS-DS Master of Data science Practice Test

MS-DS Master of Data science Master of Data science Unsupervised Machine Learning Models 1