Abstract
The paper presents methodology for analyzing a set of partitions of the same set of objects, by dividing them into classes of partitions that are similar to one another. Two different definitions are given for the consensus partition which summarizes each class of partitions. The classes are obtained using either constrained or unconstrained clustering algorithms. Two applications of the methodology are described.
| Original language | English |
|---|---|
| Pages (from-to) | 265-285 |
| Number of pages | 21 |
| Journal | Journal of Classification |
| Volume | 15 |
| Publication status | Published - 1998 |
Keywords
- classifications of classifications
- consensus partition
- constrained classification
- median partition
- medoid partition
- ALGORITHM
- MODELS