Faithful consensus methods for n-trees

Abstract

A class of new consensus methods for n-trees (hierarchical clusterings) is proposed. These methods apply systematically to an arbitrary collection of given classifications of a fixed set of taxa, and produce a single consensus classification. They are motivated by the desire that the consensus classification retain as much information as possible from the given classifications, even in the case of only approximate agreement among them. A focus of the paper is the concept of faithfulness of consensus methods; this concept explicates the informal notion of adequate retention of information referred to above, and is proposed as a desirable requirement for consensus methods in general. The new methods are all faithful; they have the additional property that they take hierarchical level into account. Other general properties of consensus methods are investigated, especially with reference to their relation with faithfulness. The most important of these properties is neutrality; loosely speaking a consensus method is neutral if all nontrivial clusters are treated equally in the conditions on the given classifications required to guarantee the appearance of a cluster in the consensus. A central result of the paper is an analogue of the classical impossibility theorem of K. Arrow: with trivial exceptions it is impossible to have a consensus method that is simultaneously faithful and neutral. Thus two intuitively very appealing general properties of consensus methods are seen to be incompatible.