Abstract
Given a profile (family) П of partitions of a set of objects or items X, we try to establish a consensus partition containing a maximum number of joined or separated pairs in X that are also joined or separated in the profile. To do so, we define a score function, 
associated to any partition on X. Consensus partitions for П are those maximizing this function. Therefore, these consensus partitions have the median property for the profile and the symmetric difference distance. This optimization problem can be solved, in certain cases, by integer linear programming. We define a polynomial heuristic which can be applied to partitions on a large set of items. In cases where an optimal solution can be computed, we show that the partitions built by this algorithm are very close to the optimum which is reached in practically all the cases, except for some sets of bipartitions
Contetnts
1. Introduction
2. Consensus formalization
3. Optimization problem
4. A simulation protocol
5. Extensions
6. Conclusions
7. References