optsil produces a partition, or clustering, of items into clusters by
iterative reallocation of items to clusters so as to maximize the mean
silhouette width of the classification. At each iteration optsil ranks all
possible re-allocations of a item from one cluster to another. The
reallocation that maximizes the change in the mean silhouette width is performed.
Because silhouette widths are not independent of clusters that are not modified,
only a single reallocation can be preformed in a single iteration. When no
further re-allocations result in an improvement, or the maximum number of
iterations is achieved, the algorithm stops.
Optsil is an unweighted algorithm, i.e. each of the objects is
included in the calculation exactly once.
Optsil can be extremely slow to converge, and is best used to ‘polish’ an
existing partition or clusterings resulting from slicing an hclust
or
from functions optpart
, pam
,
diana
or other initial clusterings. It is possible
to run optsil from a random start, but is EXTREMELY SLOW to converge, and should be
done only with caution.