Skip to main content
Cross Validated

Return to Answer

added 56 characters in body
Source Link
Has QUIT--Anony-Mousse
Has QUIT--Anony-Mousse
  • 42.9k
  • 7
  • 69
  • 111

Obviously, k-means needs to be able to compute means.

However, there is a well-known variation of it known as k-medoids or PAMk-medoids or PAM (Partitioning Around Medoids), where the medoid is the existing object most central to the cluster. K-medoids only needs the pairwise distances.

Obviously, k-means needs to be able to compute means.

However, there is a well-known variation of it known as k-medoids or PAM (Partitioning Around Medoids), where the medoid is the existing object most central to the cluster. K-medoids only needs the pairwise distances.

Obviously, k-means needs to be able to compute means.

However, there is a well-known variation of it known as k-medoids or PAM (Partitioning Around Medoids), where the medoid is the existing object most central to the cluster. K-medoids only needs the pairwise distances.

Source Link
Has QUIT--Anony-Mousse
Has QUIT--Anony-Mousse
  • 42.9k
  • 7
  • 69
  • 111

Obviously, k-means needs to be able to compute means.

However, there is a well-known variation of it known as k-medoids or PAM (Partitioning Around Medoids), where the medoid is the existing object most central to the cluster. K-medoids only needs the pairwise distances.