k-Means Clustering and Cluster Geometry Previous Year Questions (PYQs) for GATE DA: 1+ Solved Questions with Step-by-Step Solutions

    Solve 1+ k-Means Clustering and Cluster Geometry previous year questions for GATE DA with answers and detailed solutions. Free sample questions below.

    Topic Hero: Convexity & The Midpoint Rule

    Convexity & The Midpoint Rule

    The geometric shortcut that solves assignment problems in seconds.

    What you'll master:

    • Why Voronoi cells are strictly convex regions.
    • The "Line Segment Test" for cluster membership.
    • Solving exam-style "necessarily part of cluster" questions.
    Context: Unsupervised Learning > k-Means Clustering > Geometry

    The Convexity Property

    The Convexity Property

    A set is convex if for any two points , the entire line segment connecting them lies within .

    Voronoi cells are always convex.

    This is because they are formed by the intersection of half-spaces (defined by perpendicular bisectors), and the intersection of convex sets (half-spaces) is always convex. Geometrically, this means a -means cluster can never wrap around another cluster or have a "C" shape.

    k-Means Clustering and Cluster Geometry: Solved Questions with Step-by-Step Explanations (1 Problems)

    Question 1 · Machine Learning MCQ
    Euclidean distance based -means clustering algorithm was run on a dataset of 100
    points with . If the points and are both part of cluster 3, then which
    ONE of the following points is necessarily also part of cluster 3?
    1. A.

    2. B.

    3. C.

    4. D.

    More previous year questions (pyqs) in this unit

    chapter
    k-Means Clustering and Cluster Geometry Previous Year Questions (PYQs) for GATE DA: 1+ Solved Questions with Step-by-Step Solutions

    Solve 1+ k-Means Clustering and Cluster Geometry previous year questions for GATE DA with answers and detailed solutions. Free sample questions below.

    A question from this chapter

    Question 1
    Euclidean distance based -means clustering algorithm was run on a dataset of 100
    points with . If the points and are both part of cluster 3, then which
    ONE of the following points is necessarily also part of cluster 3?
    Free preview ends here

    Login to view the complete previous-year questions and solutions

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.