Clustering Methods: K-means, Hierarchical - Competitive Exam Level

Download Q&A
Q. Which of the following is NOT a step in the K-means clustering algorithm?
  • A. Assigning data points to the nearest centroid
  • B. Updating the centroid positions
  • C. Calculating the silhouette score
  • D. Choosing the initial centroids
Q. Which of the following methods can be used to determine the optimal number of clusters in K-means?
  • A. Elbow method
  • B. Silhouette analysis
  • C. Gap statistic
  • D. All of the above
Q. Which of the following methods can be used to evaluate the quality of clusters formed by K-means?
  • A. Silhouette score
  • B. Davies-Bouldin index
  • C. Both A and B
  • D. None of the above
Q. Which of the following statements about K-means clustering is true?
  • A. It can only be applied to spherical clusters
  • B. It is guaranteed to find the global optimum
  • C. It can be sensitive to the initial placement of centroids
  • D. It does not require any distance metric
Q. Which of the following statements is true about K-means clustering?
  • A. It can only be applied to large datasets
  • B. It is sensitive to the initial placement of centroids
  • C. It guarantees finding the global optimum
  • D. It can handle categorical data directly
Showing 31 to 35 of 35 (2 Pages)
Soulshift Feedback ×

On a scale of 0–10, how likely are you to recommend The Soulshift Academy?

Not likely Very likely