Input $X=\left\{x_1,x_2,\cdots ,x_n\right\}$ //set of n data items.

K // Number of desired clusters

Output:

A set of K clusters, $c_k$ : The center of each cluster and

Steps:

Repeat

· Calculate the distance between each data point and cluster centers using:

$d=\sqrt{{\left(x_i-c_x\right)}^2+{\left(y_i-c_y\right)}^2+{\left(z_i-c_z\right)}^2}$

· Assign the data point to the cluster center whose distance from the cluster center is minimum of all the cluster centers.

· Recalculate the new cluster center using:

$c_k=1/\left|G_k\right|{\displaystyle \sum _{x_i\in G_k}{x}_i}$

Until the centers don’t change.