GATE DA 2024 — Question 19

Unsupervised Learningclustering algorithms, k-means/k-medoidMCQ1 mark · −1/3 if wrongMedium

Euclidean distance based \(k\)-means clustering algorithm was run on a dataset of 100 points with \(k = 3\). If the points \(\begin{bmatrix} 1 \\ 1 \end{bmatrix}\) and \(\begin{bmatrix} -1 \\ 1 \end{bmatrix}\) are both part of cluster 3, then which ONE of the following points is necessarily also part of cluster 3?
  1. A
    \(\begin{bmatrix} 0 \\ 0 \end{bmatrix}\)
  2. B
    \(\begin{bmatrix} 0 \\ 2 \end{bmatrix}\)
  3. C
    \(\begin{bmatrix} 2 \\ 0 \end{bmatrix}\)
  4. D
    \(\begin{bmatrix} 0 \\ 1 \end{bmatrix}\)
Practise the full 2024 paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on clustering algorithms, k-means/k-medoidTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group