K Means Clustering Solved Example K Means Clustering Algorithm in Machine Learning by Mahesh Huddar

K Means Clustering Solved Example K Means Clustering Algorithm in Machine Learning by Mahesh Huddar
Use K Means clustering to cluster the following data into two groups. Assume cluster centroid are m1=4 and m2=11. The distance function used is Euclidean distance. { 2, 4, 10, 12, 3, 20, 30, 11, 25 }
The following concepts are discussed:
______________________________
k means clustering algorithm,
k means clustering example,
k means clustering,
k means,
k means algorithm,
k-means clustering algorithm,
k-means clustering example,
k-means clustering,
k-means,
k-means algorithm,
k means clustering algorithms solved example,
k means clustering example,
k means clustering solved example,
k means solved example,
k means algorithm solved example,
k means clustering algorithm 1-dimensional data,
k means clustering example 1-dimensional data,
k means clustering 1-dimensional data,
k means 1-dimensional data
********************************
1. Blog / Website: www.vtupulse.com/
2. Like Facebook Page: / vtupulse
3. Follow us on Instagram: / vtupulse
4. Like, Share, Subscribe, and Don't forget to press the bell ICON for regular updates

[@ravikolagani]

Small clarification : Square and root gets cancel in mathematics .. so the formulea is d(x2,x1) = x2-x1 -- Isn't it ?

[@darkzone3295]

if you cancel it or not but the answer remains the same right

[@lucaspecialedits4284]

The points are one dimensional here. But for higher dimension points we need to sum all squares of all differences under root.

[@MSAMIULHAQ-u3e]

To avoid minus sign
Square is compulsory or take abs val

[@sheevanulhaq3912]

It's the common mistakes that we do or we can say we got stuck with the point that root and square get's cancel. Actually in mathematics it's not like that , whenever there is square inside a root then if you want to remove both the operator then you have to leave a modulus outside. On the other hand if there is a root inside the square then we don't need modulus.
For example:-
√(x²) = |x|
(√x)² = x
Hope you get it.

[@kucklowmusic9184]

Ofcourse, it would be just like measuring distances using scale since its 1-D

[@prathmeshmohite692]

thank you sirrr ,nice teaching

[@MaheshHuddar]

Welcome
Do like share and subscribe

[@jeevithasrinivasan3199]

If both the distance to m1 and m2 are same which cluster do we need to allocate ? To new cluster ?

[@MaheshHuddar]

Assign to any one cluster and continue with new iteration

[@lukeshpraveen4763]

Sir what if i get same distances
And to which cluster do i need to assign it

[@MaheshHuddar]

Randomly assigned to one cluster and continue with new iteration

[@chaimaashaay4887]

❤

[@MaheshHuddar]

Thank You
Do like share and subscribe

[@ramyakrishnan831]

Sema explain sir I have clearly understand TQ sir

[@MaheshHuddar]

Thanks and welcome
Do like share and subscribe

[@dhanashreeshiva68]

Thank you sir..

[@MaheshHuddar]

Most welcome
Do like share and subscribe

[@tusharsoni_42]

thnx

[@MaheshHuddar]

Welcome
Do like share and subscribe

[@praneethboddu012]

If initial centroids are not given what should l do

[@mrchocon5388]

apni choice kai according choose kar loa

[@MaheshHuddar]

You can select any data points as initial centroids

[@sadiyaww7507]

@@MaheshHuddar won't the final clusters be different based on different initial centroids we choose if we are not given any initial centroid in question?

[@MaheshHuddar]

@@sadiyaww7507 No,
You can start with any centroids randomly, if not given.
Algorithm converges to correct clusters finally

[@Imspeed877]

Leave the exam hall and go back to home 🏡