Let a configuration of the k-means algorithm correspond to the k-way partition generated by the clustering at the end of each iteration. Is it possible for the k-means algorithm to revisit a configuration? Justify how your answer proves that the k-means algorithm converges in a finite number of steps.
Added by Mar J.
Step 1
The k-means algorithm starts with a random initialization of k centroids. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Steven Clarke and 86 other Intro Stats / AP Statistics educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Sri K.
When performing an unsupervised k-means clustering, is it sufficient to generate a single clustering? Do you agree with this statement? Why or why not?
Prashant B.
Recommended Textbooks
Elementary Statistics a Step by Step Approach
The Practice of Statistics for AP
Introductory Statistics
Watch the video solution with this free unlock.
EMAIL
PASSWORD