K-Means Clustering Numerical Example
K-Means Clustering Numerical Example
Clusterirg
Data Point
2 2
2 5
6
|2
13
cetrids
Randomly select two
C; = (2, 3)
- (6, )
Dut Euclidean dis tance
Now find
D=
2. 2 3
Je-2+ (s3)
3 5 5123
5 Jo 5
12-04
13 1345
Euclidean
Eudlidean to distane to cluste
Data Point dittane
|.4| 860
72|
2 3 2
2
593 J.4)
2
3
1:21
6 9 2
|2.0 4 5
5 lo |2 2-.
565
13
l3-45
mea n
taki ny the
Vbdate Centids
each clus tey
data poins
and 2
data þoint
are
COts ter |
Mean (+2), (2+3)&)
2 2
data poi nt Ye 3, 4 5, 6
-] 8, lo 5)
2
Nous find out Nen arsgned clusters
the nens Centn'ds
besed upon
Data Point
15 25 Jo -5
0:707
2
0707
2 3
2
6519
8
3
I2:74
5
13 14.15
(5- )+ -8)-
(a5-8) -st(-s9
3=
(:5-9) )ks
5-(15-)+ (215- )=J((n9 J72- 25+ o s
IC25 =12:79
2 14 I5
Euclidan diztane tor centid (8, lo5]
8) (a5)
(8-5 )+ (oS -1s-25-30
(2)+(us)
44 2 s
25
Vo-n)+(ws- 1s).e(aj.
both the
And
cluots ae Aame So we amigna
the value 6
both Ccnes
tuke
ansipnel clete
data þol nts ntil thy con ve
cluste