Faithful consensus methods for n-trees
From MaRDI portal
Publication:794118
DOI10.1016/0025-5564(82)90043-8zbMath0539.62073OpenAlexW2024470772MaRDI QIDQ794118
Publication date: 1983
Published in: Mathematical Biosciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0025-5564(82)90043-8
monotonicityneutralityPareto axiomfaithfulnessbetweenness axiomconsensus rulehierarchical clusteringsn-trees
Related Items (19)
Dictatorial consensus functions on \(n\)-trees ⋮ Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves ⋮ Preserving consensus hierarchies ⋮ Intersection rules for consensus \(n\)-trees ⋮ Stability conditions for consensus functions defined on \(n\)-trees ⋮ On the use of ordered sets in problems of comparison and consensus of classifications ⋮ N-trees as nestings: Complexity, similarity, and consensus ⋮ DASACT: a decision aiding software for axiomatic consensus theory ⋮ On an independence condition for consensus \(n\)-trees ⋮ Unnamed Item ⋮ The role of complexity in comparing classifications ⋮ s-consensus index method: An additional axiom ⋮ On lattice consensus methods ⋮ Consensus rules based on decisive families: the case of hierarchies ⋮ Efficient and binary consensus functions on transitively valued relations ⋮ Euclidean consensus dendrograms and other classification structures ⋮ Axioms for consensus functions on undirected phylogenetic trees ⋮ A formalization of consensus index methods ⋮ Optimal algorithms for comparing trees with labeled leaves
Cites Work
This page was built for publication: Faithful consensus methods for n-trees