The paper presents methodology for analyzing a set of partitions of th
e same set of objects, by dividing them into classes of partitions tha
t 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 cluste
ring algorithms. Two applications of the methodology are described.