K Means Clustering Intuition

preview_player
Показать описание
Here is a complete intuition behind K Means Clustering Algorithm. We will understand the complete the complete geometric intuition.

You can buy my book where I have provided a detailed explanation of how we can use Machine Learning, Deep Learning in Finance using python

Рекомендации по теме
Комментарии
Автор

You are amazing teacher, You are my favorite teacher, That With you i can learn Machine Learning. I am continuing to watch you❤ You are the best teacher all over the world 🌍

lemanosmanli
Автор

I usually never comment on you tube videos but seeing your videos I am forced to comment. You have got amazing explanation skills and precise knowledge!!!!

shwetadalal
Автор

Thank you Krish, thank you thank you 😭😭😭😭😭😭😭

I'm starting to love Data Science because of you 😭😭😭😭😭

I_Love_DataScience
Автор

@Krish, For calculating wcss i saw in some article it is mentioned wcss = (xi - ci)^2.

kanhathakur
Автор

Thank you so much sir ... for such an easy explanation .. .. i was so confused about it but now its all crystal clear .

swapnilsrivastava
Автор

sir should have more subscribers such a good explanation

vishwajitbhagat
Автор

love the video sir ❤
great explanation

JohnWickea
Автор

K Means Clustering Practical video is not available kindly provide it sir

manjunath.c
Автор

Sir, You have lots of video on Machine Learning accept DMM analysis
please make a video on it me and my team are waiting for this video.

saifullahshafin
Автор

hope the first video will be available, cause my exam is coming up in 3 more days x.x

yuen
Автор

Please make a video on X11, X12, X13 decomposition vs classical decomposition. 🙏

RenormalizedAdvait
Автор

Thanks for uploading this, it really helped me

meetpanchal
Автор

Thanks for the video sir but the formula of Wccs should be summation of (ci-xi)^2 we need to decrease the dist between the centroid and all the other points in this case...

ratulghosh
Автор

Really great video krish 😀! I really learnt lots of concepts. I Have a question about wcss score. As it's the distance between each data point and updated centroïd, we shouldn't make a substraction between point of data and centroid point then calculate the mean of these distances according To the number of clusters ?

E_Gaks
Автор

Great Explanation Krish.So when we have more then one clusters, we are going to take the average of all the clusters to find the WCSS value

DS_AIML
Автор

K Means Clustering Practical : @

its not available for all. it only for members of this channel

vaishnavipandiyan
Автор

Hi Krish, thank you for the video.. I appreciate a lot if you could provide the practical video which you mentioned in your video..

vinaykumarreddy
Автор

Hi, i appreciate your work, I request to you, can you upload a video of all algorithm with python coding like KNN algo Please.
Thanks

dineshkathania
Автор

Sir..Please provide K means Clustering Practical Video...Thank you

suvarnadeore
Автор

here you initialised centroid from the data points only right? i think this is kmeans++ algo. as in kmeans the 1st centroid can be anything i guess (infinity possibility) n not from the data point

satabdigantayat