A new partitioning around medoids algorithm

Subscribe to email list

Please select the email list(s) to which you wish to subscribe.

You are here

A new partitioning around medoids algorithm

TitleA new partitioning around medoids algorithm
Publication TypeJournal Article
Year of Publication2003
AuthorsVan der Laan, M, Pollard, K, Bryan, J
JournalJournal of Statistical Computation and Simulation
Volume73
Pagination575-584
AbstractKaufman and Rousseeuw (1990) proposed a clustering algorithm Partitioning Around Medoids (PAM) which maps a distance matrix into a specified number of clusters. A particularly nice property is that PAM allows clustering with respect to any specified distance metric. In addition, the medoids are robust representations of the cluster centers, which is particularly important in the common context that many elements do not belong well to any cluster. Based on our experience in clustering gene expression data, we have noticed that PAM does have problems recognizing relatively small clusters in situations where good partitions around medoids clearly exist. In this paper, we propose to partition around medoids by maximizing a criteria "Average Silhouette" defined by Kaufman and Rousseeuw (1990). We also propose a fast-to-compute approximation of "Average Silhouette". We implement these two new partitioning around medoids algorithms and illustrate their performance relative to existing partitioning methods in simulations.
URLhttp://dx.doi.org/10.1080/0094965031000136012
DOI10.1080/0094965031000136012