The process shows, using the Maximum Variance (R15) dataset, how the K-medoids method can be used.
The dataset contains 600 two-dimensional vectors, which are concentrated into 15 clusters. The points are aligned around a center with the coordinates (10,10), in increasing distances from each other as they get further from the center. This is the difficulty of the task, as the clusters near the center are close to blending into each other.
The difference of the K-medoids method from the K-means method is that the centers of the clusters have to be existing points. After setting the distance function and the number of clusters k, and then running the process, it can be seen that even though a more sophisticated distance function has been chosen, the alignment of the data did not make the precise analysis of the central clusters possible.
The process has shown that not all datasets provide a chance for the usage of arbitrary cluster analysis.