k-Medoid clustering

This scatter plot sample is used to illustrate the k-medoid clustering algorithm. "The k-medoids algorithm is a clustering algorithm related to the k-means algorithm and the medoidshift algorithm. Both the k-means and k-medoids algorithms are partitional (breaking the dataset up into groups) and both attempt to minimize the distance between points labeled to be in a cluster and a point designated as the center of that cluster." [en.wikipedia.org/wiki/K-medoids] The scatterplot example "k-Medoid clustering" was created using the ConceptDraw PRO diagramming and vector drawing software extended with the Basic Scatter Diagrams solution from the Graphs and Charts area of ConceptDraw Solution Park.