Cluster Analysis $>$ K$-$Medoids

Suppose that the data mining task is to cluster employees in terms of the

features education and salary into three clusters:$|$ The distance function is Euclidean distance.

Suppose initially we assign Ali, Belma, and Deniz as the center of each

cluster, respectively.

Work on each part separately to show the final three clusters. Show

the three clusters and their centers after every round of execution.

If distances from a point to the centers are equal, do not change the

cluster assigned for that point.

Capital letters stand for the names of employees. $ Use the k$-$medoids algorithm.Suppose that the data mining task is to cluster employees in terms of the features education and salary into three clusters: