Thank u very much I search your lecture this topic on you tube but that time you didn't upload . but today i get your important lecture thank you sir your every lecture important for us .
Really you have made it look very easy...thanks for valuable knowledge of machine learning...pl upload the series of machine learning algorithms in the same way.... thanks a lot Yogesh..
4 month lecturing in 8 months great i really understood the concept very easily explained smallest kid can understand this one thank you sir good teachers can not find in these days. you earned my subscribe
I got frustrated, I was like if I click on this and i don't understand, then I'm done with k-means, I was like is this guy going to explain better ? well let me try and you brought joy to my eyes. even after 4years, you still have a great impact on many of us. Thanks so much!!!!! you MADE LEARNING SO EASY...… CHEERS BUT one question is, what is we have say 1000 random numbers, and we have like 20 k, how to do that ????
It's really easy to understand perfect. I am perfect to solve K means algorithm any no to eligible thanks for your uploading, Lot more videos to expect...Thankyou
This tutorial is very simple and nicely explained. In the same way could you explain the " Within cluster sum of squares by cluster , between_SS, total_SS "
A very simple example and a nice elaboration of the concept. Can you also explain, what the result will be when a new element gets added after the clustering is complete. Say, if a new value 18 comes in, should we just find the nearest mean between m1 and m2 and add it to the appropriate cluster or reshuffle the set again? I know, I sound silly but want to know.
Hi Ramanathan S.P. , I am glad if it helped you.To answer your question,if a new number 18 is added you should consider that from the start coz here the means or centroid are calculated considering all the data present initially..also k means always gives approximate results..
Jeevitha M ...I am glad if it helped you...sound might be low as it's one of my first videos when I started with RUclips channel.. thanks for suggestion..I will definitely take care in future
What if lik this example Apply K-Means approach to construct two clusters M1= (1,2,3) and M2= ( 0, -2, -5 ) of the following data ? X1= (2,3,4) , X2=(1.5,2.7,3.1) , X3= ( 0.5, -3, -5 ) , X4= (2.6,3.5,4.8) , X5=(0.7,1.2,2.3) and X6= ( 0.1, -3, -4 ) ?
this is just an example to understand the concept...but in implementation we have methods to decide value of k and algorithms takes care that it will get different distances.....
when we are calculating k1 and k2 itself, euclidean distance / minimum distance is calculated. The elements in the problem set which are having minimum distance with mean is considered.
Really thank you very much for uploading k-means algorithm...you made it really very easy to understand.... Thank you very much...
Thank u very much I search your lecture this topic on you tube but that time you didn't upload . but today i get your important lecture thank you sir your every lecture important for us .
Thanks once again for uploading an important topic of machine learning... waiting for more
Really you have made it look very easy...thanks for valuable knowledge of machine learning...pl upload the series of machine learning algorithms in the same way.... thanks a lot Yogesh..
Super. I am learning R program. Your simple explanation make me understand the concept well Thanks
Usefull to pass an exam at University; thank you
4 month lecturing in 8 months great i really understood the concept very easily explained smallest kid can understand this one thank you sir good teachers can not find in these days. you earned my subscribe
awesome.......
I got frustrated, I was like if I click on this and i don't understand, then I'm done with k-means, I was like is this guy going to explain better ? well let me try and you brought joy to my eyes. even after 4years, you still have a great impact on many of us. Thanks so much!!!!! you MADE LEARNING SO EASY...… CHEERS
BUT one question is, what is we have say 1000 random numbers, and we have like 20 k, how to do that ????
Easy to understand with nice and simple example. Thanks.
Very nice sir... easily explain to understand
Thank you very much for this video. It is perfectly simplified.
A very nice job. please do another video for the algorithm with multiple dimensions.
Thank you so much.
It's really easy to understand.
Excellent
Thanks a lot once again...Just keep posting..
absolutely simplified....thank you...
It's really easy to understand perfect. I am perfect to solve K means algorithm any no to eligible thanks for your uploading, Lot more videos to expect...Thankyou
Really made easy to understood. Thanks a lot 👍
great video
Good work sir
Thanks a lot for sharing...
Thanks a lot for the explanation.
Wowwwwwwwwww nyc sir tq
really explained in a simple manner , thankyou sir
underrated talent
This tutorial is very simple and nicely explained.
In the same way could you explain the " Within cluster sum of squares by cluster , between_SS, total_SS "
yes sure i will forward the link for wcss explanation and implementation ...... Also its use in Kmeans algorithm to decide 'k' value.....
Good video.. understand the concept within short span of time but you should also include python programming for this algo
sure
Superb, super awesome
Excellent 👌👌👌👌
Please do video on differential privacy sir
A very simple example and a nice elaboration of the concept. Can you also explain, what the result will be when a new element gets added after the clustering is complete. Say, if a new value 18 comes in, should we just find the nearest mean between m1 and m2 and add it to the appropriate cluster or reshuffle the set again? I know, I sound silly but want to know.
Hi Ramanathan S.P. , I am glad if it helped you.To answer your question,if a new number 18 is added you should consider that from the start coz here the means or centroid are calculated considering all the data present initially..also k means always gives approximate results..
@@yogeshmurumkar Thanks a lot...!!!
Excellent!!!!
Thank you very much
Thank you, it justifies the content
Make a video on pam algorithm please!
Very Nice!!
You are an amazing teacher, have you thought about doing a video on "Maximum Likelihood" for finding the coefficients for logistic regression?
I am glad if it helped you Russell....and yeah I will come with a video on Maximum Likelihood...
@@yogeshmurumkar That would be amazing!
Thanks a lot sir ,thanq thanq............
Thank you sir
Thanks a lot ur video is really understandable and one defect it is sound is little bit low.
Jeevitha M ...I am glad if it helped you...sound might be low as it's one of my first videos when I started with RUclips channel.. thanks for suggestion..I will definitely take care in future
Thank you boss
Thank you so much 🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹🌹
Thanks man. good job !
thanks a lot
sir take 10 and 20 for initial cluster we could get the answer quickly
yes sujith thats possible ...here I just taken randomly for explanation....
What if lik this example Apply K-Means approach to construct two clusters M1= (1,2,3) and M2= ( 0, -2, -5 ) of the following data ?
X1= (2,3,4) , X2=(1.5,2.7,3.1) , X3= ( 0.5, -3, -5 ) , X4= (2.6,3.5,4.8) , X5=(0.7,1.2,2.3) and X6= ( 0.1, -3, -4 ) ?
excellent...
excellent
very nice!!!!!!
K-means algorithm
Sir I need explanation with some examples of data set then explain the k means algorithm in R Language that's more efficient manner I think so
sure i will make it in R also...
What if we get same difference for some number while clustering??
Eg:while doing when m1=3 and me=18 to cluster 11 weget same difference.
this is just an example to understand the concept...but in implementation we have methods to decide value of k and algorithms takes care that it will get different distances.....
Bro hierarchical clustering ku examples kutunga. bro neenga panathu Central clustering thana bro
It's not mean you chose random , it should be a Centroid..hope you consider that
sir this is an example to understand the concept...please see the implementation also...done in my other videos...
wow
sir I think your voice should be a little bit clear. otherwise great job sir
Thanks for the suggestion...I will take care for the same ...as its a first of few videos when i started ... anyway thanks sai..
Here,where is the Euclidean distance???
Pls rply
when we are calculating k1 and k2 itself, euclidean distance / minimum distance is calculated. The elements in the problem set which are having minimum distance with mean is considered.
So M1 and m2 is centroid ?
mean , here we have taken a simple example to understand k means.....yes we are assuming them as centroid here
@@yogeshmurumkar Can I have your linked in or any social media link
Sir, ur making little bit confusing
Konjam tamil aaa sollunga sir
Enkita kelu mapla na soldren 8220299484
thank you sir