(ML 16.1) K-means clustering (part 1)

A K-means video that explains the K-Means AND the math. Well done.

i have a question if a point is equidistant from two cluster's cent.roid. then which cluster should we assign that point to?

which software do u use to write? I have been wondering since long about this software

Good explanation , but I suppose an example can make it more clear
:)

Very good explanation. Could you make a new video about Hierarchical Agglomerative Clustering as shown in Pattern Recognition book(Theodoridis and Koutroumbas) ? Thanks!

i'm sorry, but i don't understand the statement "where xi is assigned to j"...can somebody please explain this statement to me. thx

Great explanation, thanks

Mustafa - found this on the About page

- Wacom Bamboo Fun tablet - medium size (~$150 pen tablet)
- SmoothDraw 3.2.7 (free drawing program)
- HyperCam 2 (free screen capture program)
- Sennheiser ME 3-ew (~$125 headset microphone)

can any one tell us what is the name of program that the author used to explain the K mean algorithm ??

Thank you!

Why is the square of the distance usually used in this kind of calculation? Wouldn't just taking the modulus be simpler and closer to the real picture?

two minutes in and i already understood more than what my database professor taught in an hour. thank you!

thanks!

Your videos are so divinely easy to understand. Thank you very much for your content. PS - you should solicit donations --- I would gladly partake in such an effort to support your work!

Thumbs up if this week is your clustering midterm :)

This is good.

each variable is a different dimension, with the standard axis he has draw shows 2 dimensions. if you had 3, the axis would come out of the screen, 4+ is more difficult to visualize but the same method is being used to find centroids and euclean distance between them. I think I explained it badly but I hope this helps.

Why is not everyone teaching like this man?

thank you,, it helps me a lot!! : )

Thank you so match you explain excellent!