GATE Machine Learning: Unsupervised learning: clustering – Previous Year Questions

4 GATE previous year questions on Unsupervised learning: clustering (Machine Learning, Data Science and Artificial Intelligence) with answers and explanations, from every paper.

1. GATE 2024 DA Q19 (1 mark, Multiple choice) – Euclidean distance based k-means clustering algorithm was run on a dataset of 100 points with k = 3. If the points bmatrix1\\1bmatrix and…
2. GATE 2024 DA Q42 (2 marks, Multiple choice) – Consider the table below, where the (i, j)th element of the table is the distance between points x i and x j. Single linkage clustering is performed…
3. GATE 2025 DA Q30 (1 mark, Multiple select) – Let C 1 and C 2 be two sets of objects. Let D(x, y) be a measure of dissimilarity between two objects x and y. Consider the following definitions of…
4. GATE 2026 DA Q36 (2 marks, Multiple choice) – Let four points in three-dimensional space be: P1: [2, 3, -1], P2: [3, 1, 1], P3: [5, -2, 3] and P4: [3, 3, 3]. Hierarchical Agglomerative Clustering…