Data Warehousing and Data Mining20785 marksNumerical: K-Means clusteringClustering techniques
Apply K(=2)-Means algorithm over the data (185, 72), (170, 56), (168, 60), (179, 68), (182, 72), (188, 77) up to two iterations and show the clusters. Initially choose first two objects as initial centroids.
Apply K(=2)-Means algorithm over the data (185, 72), (170, 56), (168, 60), (179, 68), (182, 72), (188, 77) up to two iterations and show the clusters. Initially choose first two objects as initial centroids. [5]
Point Data ------------- P1 (185, 72) P2 (170, 56) P3 (168, 60) P4 (179, 68) P5 (182, 72) P6 (188, 77) Initial Centroids: $C1 = (185, 72)$, $C2 = (170, 56)$ Distance metric: Euclidean, $d = \sqrt{(x2-x1)^2 + (y2-y1)^2}$ --- Distances to $C1=(185,72)$: - P1: $\sqrt{0+0}=0$ - P2: