Silhouette (clustering)

Silhouette is a method of interpretation and validation of consistency within clusters of data. The technique provides a succinct graphical representation of how well each object has been classified.^[1] It was proposed by Belgian statistician Peter Rousseeuw in 1987.

The silhouette value is a measure of how similar an object is to its own cluster (cohesion) compared to other clusters (separation). The silhouette ranges from −1 to +1, where a high value indicates that the object is well matched to its own cluster and poorly matched to neighboring clusters. If most objects have a high value, then the clustering configuration is appropriate. If many points have a low or negative value, then the clustering configuration may have too many or too few clusters. A clustering with an average silhouette width of over 0.7 is considered to be "strong", a value over 0.5 "reasonable" and over 0.25 "weak", but with increasing dimensionality of the data, it becomes difficult to achieve such high values because of the

Assume the data have been clustered via any technique, such as

${\displaystyle k}$

For data point ${\displaystyle i\in C_{I}}$ (data point ${\displaystyle i}$ in the cluster ${\displaystyle C_{I}}$), let

${\displaystyle a(i)={\frac {1}{|C_{I}|-1}}\sum _{j\in C_{I},i\neq j}d(i,j)}$

be the mean distance between ${\displaystyle i}$ and all other data points in the same cluster, where ${\displaystyle |C_{I}|}$ is the number of points belonging to cluster ${\displaystyle C_{I}}$, and ${\displaystyle d(i,j)}$ is the distance between data points ${\displaystyle i}$ and ${\displaystyle j}$ in the cluster ${\displaystyle C_{I}}$ (we divide by ${\displaystyle |C_{I}|-1}$ because we do not include the distance ${\displaystyle d(i,i)}$ in the sum). We can interpret ${\displaystyle a(i)}$ as a measure of how well ${\displaystyle i}$ is assigned to its cluster (the smaller the value, the better the assignment).

We then define the mean dissimilarity of point ${\displaystyle i}$ to some cluster ${\displaystyle C_{J}}$ as the mean of the distance from ${\displaystyle i}$ to all points in ${\displaystyle C_{J}}$ (where ${\displaystyle C_{J}\neq C_{I}}$).

For each data point ${\displaystyle i\in C_{I}}$, we now define

${\displaystyle b(i)=\min _{J\neq I}{\frac {1}{|C_{J}|}}\sum _{j\in C_{J}}d(i,j)}$

to be the smallest (hence the ${\displaystyle \min }$ operator in the formula) mean distance of ${\displaystyle i}$ to all points in any other cluster (i.e., in any cluster of which ${\displaystyle i}$ is not a member). The cluster with this smallest mean dissimilarity is said to be the "neighboring cluster" of ${\displaystyle i}$ because it is the next best fit cluster for point ${\displaystyle i}$.

We now define a silhouette (value) of one data point ${\displaystyle i}$

${\displaystyle s(i)={\frac {b(i)-a(i)}{\max\{a(i),b(i)\}}}}$, if ${\displaystyle |C_{I}|>1}$

and

${\displaystyle s(i)=0}$, if ${\displaystyle |C_{I}|=1}$

Which can be also written as:

${\displaystyle s(i)={\begin{cases}1-a(i)/b(i),&{\mbox{if }}a(i)<b(i)\\0,&{\mbox{if }}a(i)=b(i)\\b(i)/a(i)-1,&{\mbox{if }}a(i)>b(i)\\\end{cases}}}$

From the above definition it is clear that

${\displaystyle -1\leq s(i)\leq 1}$

Note that ${\displaystyle a(i)}$ is not clearly defined for clusters with size = 1, in which case we set ${\displaystyle s(i)=0}$. This choice is arbitrary, but neutral in the sense that it is at the midpoint of the bounds, -1 and 1.^[1]

For ${\displaystyle s(i)}$ to be close to 1 we require ${\displaystyle a(i)\ll b(i)}$. As ${\displaystyle a(i)}$ is a measure of how dissimilar ${\displaystyle i}$ is to its own cluster, a small value means it is well matched. Furthermore, a large ${\displaystyle b(i)}$ implies that ${\displaystyle i}$ is badly matched to its neighbouring cluster. Thus an ${\displaystyle s(i)}$ close to 1 means that the data is appropriately clustered. If ${\displaystyle s(i)}$ is close to -1, then by the same logic we see that ${\displaystyle i}$ would be more appropriate if it was clustered in its neighbouring cluster. An ${\displaystyle s(i)}$ near zero means that the datum is on the border of two natural clusters.

The mean ${\displaystyle s(i)}$ over all points of a cluster is a measure of how tightly grouped all the points in the cluster are. Thus the mean ${\displaystyle s(i)}$ over all data of the entire dataset is a measure of how appropriately the data have been clustered. If there are too many or too few clusters, as may occur when a poor choice of ${\displaystyle k}$ is used in the clustering algorithm (e.g.,

Kaufman et al. introduced the term silhouette coefficient for the maximum value of the mean ${\displaystyle s(i)}$ over all data of the entire dataset,[5] i.e.,

${\displaystyle SC=\max _{k}{\tilde {s}}\left(k\right),}$

where ${\displaystyle {\tilde {s}}\left(k\right)}$ represents the mean ${\displaystyle s(i)}$ over all data of the entire dataset for a specific number of clusters ${\displaystyle k}$.

Computing the silhouette coefficient needs all ${\displaystyle {\mathcal {O}}(N^{2})}$ pairwise distances, making this evaluation much more costly than clustering with k-means. For a clustering with centers ${\displaystyle \mu _{C_{I}}}$ for each cluster ${\displaystyle C_{I}}$, we can use the following simplified Silhouette for each point ${\displaystyle i\in C_{I}}$ instead, which can be computed using only ${\displaystyle {\mathcal {O}}(Nk)}$ distances:

${\displaystyle a'(i)=d(i,\mu _{C_{I}})}$ and ${\displaystyle b'(i)=\min _{C_{J}\neq C_{I}}d(i,\mu _{C_{J}})}$,

which has the additional benefit that ${\displaystyle a'(i)}$ is always defined, then define accordingly the simplified silhouette and simplified silhouette coefficient^[6]

${\displaystyle s'(i)={\frac {b'(i)-a'(i)}{\max\{a'(i),b'(i)\}}}}$

${\displaystyle SC'=\max _{k}{\frac {1}{N}}\sum _{i}s'\left(i\right)}$.

If the cluster centers are

If every object is assigned to the nearest medoid (as in k-medoids clustering), we know that ${\displaystyle a'(i)\leq b'(i)}$, and hence ${\displaystyle s'(i)={\frac {b'(i)-a'(i)}{b'(i)}}=1-{\frac {a'(i)}{b'(i)}}}$.[8]

Instead of using the average silhouette to evaluate a clustering obtained from, e.g., k-medoids or k-means, we can try to directly find a solution that maximizes the Silhouette. We do not have a closed form solution to maximize this, but it will usually be best to assign points to the nearest cluster as done by these methods. Van der Laan et al.^[7] proposed to adapt the standard algorithm for k-medoids, PAM, for this purpose and call this algorithm PAMSIL:

1. Choose initial medoids by using PAM
2. Compute the average silhouette of this initial solution
3. For each pair of a medoid m and a non-medoid x
   1. swap m and x
   2. compute the average silhouette of the resulting solution
   3. remember the best swap
   4. un-swap m and x for the next iteration
4. Perform the best swap and return to 3, otherwise stop if no improvement was found.

The loop in step 3 is executed for ${\displaystyle {\mathcal {O}}(Nk)}$ pairs, and involves computing the silhouette in ${\displaystyle {\mathcal {O}}(N^{2})}$, hence this algorithm needs ${\displaystyle {\mathcal {O}}(N^{3}ki)}$ time, where i is the number of iterations.

Because this is a fairly expensive operation, the authors propose to also use the medoid-based silhouette, and call the resulting algorithm PAMMEDSIL.^[7] It needs ${\displaystyle {\mathcal {O}}(N^{2}k^{2}i)}$ time.

Batool et al. propose a similar algorithm under the name OSil, and propose a CLARA-like sampling strategy for larger data sets, that solves the problem only for a sub-sample.^[9]

By adopting recent improvements to the PAM algorithm, FastMSC reduces the runtime using the medoid silhouette to just ${\displaystyle {\mathcal {O}}(N^{2}i)}$.^[8]

By starting with a maximum number of clusters k_max and iteratively removing the worst center (in terms of a change in silhouette) and re-optimizing, the best (highest medoid silhouette) clustering can be automatically determined. As data structures can be reused, this reduces the computation cost substantially over repeatedly running the algorithm for different numbers of clusters.^[10] This algorithm needs pairwise distances and is typically implemented with a pairwise distance matrix. The ${\displaystyle {\mathcal {O}}(N^{2})}$ memory requirement is the main limiting factor for applying this to very large data sets.

• Cluster analysis
• Davies–Bouldin index
• Calinski-Harabasz index
• Dunn index
• Determining the number of clusters in a data set
• Density-based clustering validation