The K-Means clustering algorithm iteratively updates the _________ to minimize the sum of squared distances within each cluster.

  • Centroids
  • Distance metric
  • Learning rate
  • Number of clusters
The K-Means algorithm works by iteratively updating the centroids, minimizing the sum of squared distances from each point to its assigned centroid, thus forming cohesive clusters.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *