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.
Loading...
Related Quiz
- The Naive Bayes classifier assumes that the presence or absence of a particular feature of a class is ________ of the presence or absence of any other feature.
- If the data is linearly separable, using a _________ kernel in SVM will create a linear decision boundary.
- When determining the number of clusters (K) for K-means clustering, which method involves plotting the variance as K increases and looking for an "elbow" in the plot?
- Can you detail how to prevent overfitting in Polynomial Regression?
- How would you select the appropriate linkage method if the clusters in the data are known to have varying shapes and densities?