Question: Next, he needs to compute the distance from each data point ( i . e . , a customer ) to each centroid above to
Next, he needs to compute the distance from each data point ie a customer to each centroid
above to determine to which cluster each data point belongs. In order to illustrate kmeans
algorithms to others, he uses a customer ie a data point with a tenure of months and $ in
monthly charges as an example
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
