On lattice consensus methods (Q1822176)

Three types of classifications: partitions, dendrograms and n-trees are considered in this paper, which is dedicated to the study of the consensus problem. For a given type of classification, the consensus problem consists in aggregating different classifications into a single one of the same type. Lattice polynomials are the natural consensus functions for partitions and dendrograms. The authors extend lattice methods to n-trees introducing a new class of consensus functions.