GATE DA 2026 Set 1 — Question 23
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MSQ+1 / -0EasyNaive Bayes ClassifierClassificationMachine Learningk-Medoids ClusteringClusteringLinear Discriminant Analysis (LDA)Dimensionality ReductionSampling-Based InferenceUncertaintyArtificial Intelligence
Artificial Intelligence → Classification → k-Medoids Clustering
Last updated
Question
In the following table, the
Which of the following options is/are the correct matching(s)?
Task column lists a few tasks related to machine learning. The Algorithm column lists a few algorithms.Each entry “t” from the Task column is to be matched with an appropriate entry “a” from the Algorithm column such that the task “t” can be solved using the algorithm “a”. Denote such a match as t:a| Task | Algorithm |
|---|---|
| T1 – Clustering | A1 – Markov Chain Monte Carlo |
| T2 – Classification | A2 – K-Medoid |
| T3 – Sampling | A3 – Linear Discriminant Analysis |
| T4 – Feature Extraction | A4 – Naive Bayes |
Correct answer
(B) T1:A2, T2:A4, T3:A1, T4:A3
Solution
We match each task to the appropriate algorithm:
1.T1 – Clustering: K-Medoid (A2) is a clustering algorithm similar to K-Means but uses actual data points as centers. So, T1:A2.
2.T2 – Classification: Naive Bayes (A4) is a well-known probabilistic classification algorithm. So, T2:A4.
3.T3 – Sampling: Markov Chain Monte Carlo (A1) is a class of algorithms for sampling from a probability distribution. So, T3:A1.
4.T4 – Feature Extraction: Linear Discriminant Analysis (A3) is used for dimensionality reduction and feature extraction (as well as classification). So, T4:A3.
The correct matching is T1:A2, T2:A4, T3:A1, T4:A3.This corresponds to Option (B).Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE DA question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Classification
2026 Set 1 Q11For a classification problem, Principal Component Analysis (PCA) has been used to reduce the…2026 Set 1 Q12Consider that you are training a classifier for a 10-class classification problem. Each input is…2026 Set 1 Q13Which of the following algorithms is NOT an example of uninformed search?2026 Set 1 Q14Which of the following statements is NOT true? (The names of the predicates are intuitive.)2026 Set 1 Q24Sentence is said to entail Sentence if whenever is TRUE, also must hold TRUE. Which…