I have been researching and studying about partition-based clustering algorithms like K-means and K-Medoids. I have learned that K-medoids is more robust to outliers compared to K-means. However I am curious on what will happen if during the assigning of data points, two or more cluster representatives have the same distance on a data point. Which cluster will you assign the data point? Will the assignment of the data point to a cluster greatly affect the clustering results?
To prevent bad things from happening (infinite loops etc.) always prefer the cluster the point already is assigned to when tied.
来源：https://stackoverflow.com/questions/46368307/k-medoids-k-means-algorithm-data-point-with-the-equal-distances-between-two-o