This is machine translation

Translated by Microsoft
Mouse over text to see original. Click the button below to return to the English verison of the page.

k-Means and k-Medoids Clustering

Cluster by minimizing mean or medoid distance, calculate Mahalanobis distance

k-means and k-medoids clustering partitions data into k number of mutually exclusive clusters. These techniques assign each observation to a cluster by minimizing the distance from the data point to the mean or median location of its assigned cluster, respectively. Mahalanobis distance is a unitless measure computed using the mean and standard deviation of the sample data, and accounts for correlation within the data.


kmeans k-means clustering
kmedoids k-medoids clustering
mahal Mahalanobis distance


Introduction to Cluster Analysis

Understand the basic types of cluster analysis.

k-Means Clustering

Partition data into k mutually exclusive clusters.

Was this topic helpful?