An optimal \(k\)-medoids partition of the given cluster ensemble is
defined as a partition of the objects \(x_i\) (the elements of the
ensemble) into \(k\) classes \(C_1, \ldots, C_k\) such that the
criterion function
\(L = \sum_{l=1}^k \min_{j \in C_l} \sum_{i \in C_l} d(x_i, x_j)\)
is minimized.
Such secondary partitions (e.g., Gordon & Vichi, 1998) are obtained by
computing the dissimilarities \(d\) of the objects in the ensemble
for the given dissimilarity method, and applying a dissimilarity-based
\(k\)-medoids solver to \(d\).