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

preview_player
Показать описание
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

********************************

4. Like, Share, Subscribe, and Don't forget to press the bell ICON for regular updates
Рекомендации по теме
Комментарии
Автор

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

jeevithasrinivasan
Автор

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

ravikolagani
Автор

Sema explain sir I have clearly understand TQ sir

ramyakrishnan
Автор

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

lukeshpraveen
Автор

If initial centroids are not given what should l do

praneethboddu