SA-Question 3. In class we learned about the K-means algorithm. Indeed, the K-means algorithm can be written as a variant of the gradient descent procedure. Reformulate each update of the K-means algorithm as a gradient descent update.
Added by Marvin G.
Close
Step 1
First, initialize the K-means algorithm with the randomly generated initial points. Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 66 other AP CS 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
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.
Sri K.
Explain what is the K-means algorithm cost function.
Adi S.
Write an update equation for stochastic gradient descent based on a minibatch size of 2. The update equation chooses the next guess based on the Loss function, the last guess, and the current step size. We are minimizing L(Θ) = Σ(Ln(Θi))T where i ranges over 1, 2, ..., 5 and n ranges over 1, 2, ..., 3.
Madhur L.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD