On the use of ordered sets in problems of comparison and consensus of classifications

@article{Barthelemy1986OnTU,
  title={On the use of ordered sets in problems of comparison and consensus of classifications},
  author={J. Barthelemy and Bruno Leclerc and Bernard Monjardet},
  journal={Journal of Classification},
  year={1986},
  volume={3},
  pages={187-224}
}
Ordered set theory provides efficient tools for the problems of comparison and consensus of classifications Here, an overview of results obtained by the ordinal approach is presented Latticial or semilatticial structures of the main sets of classification models are described Many results on partitions are adaptable to dendrograms; many results on n-trees hold in any median semilattice and thus have counterparts on ordered trees and Buneman (phylogenetic) trees For the comparison of… 
Thresholded consensus for n-trees
A class of (multiple) consensus methods for n-trees (dendroids, hierarchical classifications) is studied. This class constitutes an extension of the so-called median consensus in the sense that we
The residuation model for the ordinal construction of dissimilarities and other valued objects
TLDR
This chapter presents an ordinal model of valued objects, special cases of which appear in many contexts, and applies the model in order to obtain and study dissimilarities such as ultrametrics, Robinson or tree-compatible ones.
THE AVERAGE CONSENSUS PROCEDURE : COMBINATION OF WEIGHTED TREES CONTAINING IDENTICAL OR OVERLAPPING SETS OF TAXA
—The average consensus procedure, originally proposed to combine dendrograms (i.e., ultrametric trees), is extended here to apply to any type of tree with branch lengths (ultrametric or not)
Building trees, hunting for trees, and comparing trees : theory and methods in phylogenetic analysis
TLDR
It is proved that there exist rules of every order that cannot be reduced to lower order rules, and several new NPcompleteness results and a list of standard NP-complete phylogenetic problems are discussed.
Méthodes ordinales et combinatoires en analyse des données
TLDR
A set of methods using ordinal or combinatorial techniques for Boolean analysis and graph theory approach for binary data, tree representations, seriation methods for symmetric or not symmetric dissimilarity arrays, preferences aggregation procedures and consensus problems are studied.
Distance and Consensus for Preference Relations Corresponding to Ordered Partitions
TLDR
The goal of this paper is to align developments in quantitative social sciences and decision theory with the current thought in Computer Science, including a few novel results on binary preference relations, the so-called weak orders that are in one-to-one correspondence with rankings.
Optimal algorithms for computing the Robinson and Foulds topologic distance between two trees and the strict consensus trees of k trees given their distance matrices
TLDR
An optimal algorithm using circular orders to compare the topology of two trees given by their distance matrices, which allows the Robinson and Foulds topologic distance between two trees to be computed in O(kn2) time.
THE AVERAGE CONSENSUS PROCEDURE: COMBINATION OF WEIGHTED TREES CONTAINING IDENTICAL OR OVERLAPPING SETS OF TAXA
The average consensus procedure, originally proposed to combine dendrograms (i.e., ultrametric trees), is extended here to apply to any type of tree with branch lengths (ultrametric or not)
On the Fitting and Consensus of Classification Systems
Classification systems are families of subsets (classes) of a fixed set S that are closed for intersection and contain S and every single element subset of S. The main problem conidered here is that
...
...

References

SHOWING 1-10 OF 74 REFERENCES
Determining the asymptotic number of phylogenetic trees
TLDR
Formulas are found for the exact numbers of phylogenetic trees with n labels, and numerical results are presented for selected n⩽40, and the asymptotic behaviour of these numbers as n → ∞ is determined.
s-Consensus trees and indices
In the field of numerical taxonomy it is often desirable to determine a tree which is the consensus (common part) of severaln-trees, each of which represents a classification of the same set of
Optimal algorithms for comparing trees with labeled leaves
TLDR
Algorithms are described that exploit a special representation of the clusters of any treeT Rn, one that permits testing in constant time whether a given cluster exists inT, and enable well-known indices of consensus between two trees to be computed inO(n) time.
...
...