Clustering Essentials: K-Means, Hierarchical & DBSCAN Quiz — Questions & Answers

Explore key concepts of clustering with this quiz focused on K-Means, Hierarchical, and DBSCAN algorithms. Assess your understanding of how these clustering methods work, their strengths, and their differences across essential clustering scenarios.

This quiz contains 10 questions. Below is a complete reference of all questions, answer choices, and correct answers. You can use this section to review after taking the interactive quiz above.

1. Question 1: K-Means Cluster Centers

   In the K-Means clustering algorithm, what do the cluster centers (centroids) represent in a dataset of two-dimensional points?

   • The data point farthest from all other points
   • The median value of each cluster's coordinates
   • Randomly chosen points during initialization
   • The arithmetic mean of all points assigned to a cluster
   Show correct answer

   Correct answer: The arithmetic mean of all points assigned to a cluster

   Explanation: In K-Means, each cluster center, or centroid, is calculated as the arithmetic mean of all points in its cluster. This minimizes within-cluster variance. The farthest data point is not the centroid, but rather an outlier or edge point. The median is not used to compute K-Means centroids. While initialization starts with random points, centroids are updated as means during clustering.

2. Question 2: Number of Clusters in K-Means

   Which of the following accurately describes how the number of clusters is determined in K-Means clustering?

   • It is specified by the user before running the algorithm
   • It is always equal to the maximum data dimension
   • It is chosen by the algorithm based on the data size
   • It is automatically determined using dendrograms
   Show correct answer

   Correct answer: It is specified by the user before running the algorithm

   Explanation: K-Means requires the user to specify the desired number of clusters, known as 'k', before the algorithm starts. Dendrograms relate to hierarchical clustering, not K-Means. The algorithm itself does not automatically select k based on data size. There is no requirement that the number of clusters equals the data's dimensionality.

3. Question 3: Hierarchical Clustering Structure

   What structure does hierarchical clustering produce to represent the grouping of data points?

   • A confusion matrix
   • A tree-like dendrogram
   • A scatter plot
   • A single flat list
   Show correct answer

   Correct answer: A tree-like dendrogram

   Explanation: Hierarchical clustering creates a dendrogram, which is a tree-like structure showing how clusters are merged or split at various steps. It is not represented as a flat list, which lacks hierarchical information. A scatter plot visualizes data but does not represent clustering structure. A confusion matrix is used for classification evaluation, not clustering.

4. Question 4: DBSCAN Core Points

   In DBSCAN, what is a 'core point' within the dataset?

   • A point with at least a minimum number of neighbors within a specified distance
   • A random starting point for clusters
   • The farthest point from the dataset center
   • A point that does not belong to any cluster
   Show correct answer

   Correct answer: A point with at least a minimum number of neighbors within a specified distance

   Explanation: A core point in DBSCAN must have at least a minimum number of neighboring points within a set distance. It is not defined by being farthest from the dataset center. Points that do not belong to clusters are noise or outlier points, not core points. Random starting points are more related to algorithms like K-Means, not DBSCAN.

5. Question 5: Shape of Clusters in K-Means

   Which statement best describes the shape of clusters that K-Means performs well on?

   • Clusters forming concentric circles
   • Clusters that overlap heavily
   • Clusters that are roughly spherical and equally sized
   • Clusters of any arbitrary shape and size
   Show correct answer

   Correct answer: Clusters that are roughly spherical and equally sized

   Explanation: K-Means works best with clusters that are spherical and similarly sized because it relies on Euclidean distance from centroids. It struggles with arbitrary shapes or clusters that overlap, as its distance metric isn't flexible. Clusters forming concentric circles confuse K-Means, as the centroids won't align well with the true clusters.

6. Question 6: Noise in DBSCAN

   How does DBSCAN handle noise or outlier data points in clustering?

   • It explicitly labels them as noise and excludes them from clusters
   • It merges noise points into the largest cluster
   • It assigns all points to the nearest cluster
   • It ignores noise completely and does not mark them
   Show correct answer

   Correct answer: It explicitly labels them as noise and excludes them from clusters

   Explanation: DBSCAN identifies points that neither qualify as core nor border points as noise, and these are excluded from any cluster. Assigning all points to clusters is what K-Means does, but not DBSCAN. Merging noise into the largest cluster reduces clustering quality, and DBSCAN does not ignore noise; it labels such points distinctly.

7. Question 7: Clustering Hierarchies

   Which clustering approach naturally produces a hierarchy of nested clusters?

   • K-Means clustering
   • Hierarchical clustering
   • DBSCAN
   • Principal Component Analysis
   Show correct answer

   Correct answer: Hierarchical clustering

   Explanation: Hierarchical clustering forms a tree structure (dendrogram) with nested clusters at multiple levels. K-Means and DBSCAN only assign data to flat groups, not hierarchies. Principal Component Analysis is not a clustering technique, but a dimensionality reduction method, so it does not form clusters at all.

8. Question 8: DBSCAN Parameters

   Which two main parameters must be set for DBSCAN to work properly?

   • Tree depth and splitting criterion
   • Variance threshold and number of neighbors
   • Number of clusters and learning rate
   • Epsilon (maximum distance) and minimum points per cluster
   Show correct answer

   Correct answer: Epsilon (maximum distance) and minimum points per cluster

   Explanation: DBSCAN requires 'epsilon' (the maximum distance for neighbor points) and the minimum number of points required to form a dense region. There is no learning rate or required number of clusters for DBSCAN, unlike in K-Means. Tree depth and splitting criteria relate to decision trees, not clustering. Variance threshold and neighbors pertain to other algorithms.

9. Question 9: K-Means Initialization

   Why can the initial choice of centroids affect the results of K-Means clustering?

   • It prevents any further iteration after the first step
   • It always finds the unique global minimum regardless of starting point
   • It produces clusters of identical shapes every time
   • It can cause the algorithm to converge to different local minima
   Show correct answer

   Correct answer: It can cause the algorithm to converge to different local minima

   Explanation: K-Means is sensitive to initial centroid placement and may converge to different local minima, leading to various clusterings in different runs. It does not guarantee a unique global minimum due to random initialization. Shapes of clusters can vary, and iterations proceed regardless of the starting points; the process is not halted prematurely.

10. Question 10: Cluster Assignment in Hierarchical Clustering

    How are data points assigned to clusters in agglomerative hierarchical clustering?

    • By splitting all points into singletons at the beginning and never merging
    • By assigning points to clusters based on maximum density
    • By randomly assigning points at each iteration
    • By iteratively merging the closest pairs of clusters until a stopping criterion is met
    Show correct answer

    Correct answer: By iteratively merging the closest pairs of clusters until a stopping criterion is met

    Explanation: Agglomerative hierarchical clustering starts with each point as a singleton and iteratively merges the closest clusters until a desired number or level is reached. Assigning points by density refers to DBSCAN, not hierarchical clustering. Random assignment does not create meaningful clusters, and points are not kept as singletons indefinitely, but merged into clusters.