N-trees as nestings: Complexity, similarity, and consensus

DOI10.1007/BF01894192zbMath0647.62057OpenAlexW2022293103MaRDI QIDQ1104670

Edward N. III Adams

Publication date: 1986

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01894192

zbMATH Keywords

similarity measuresclustersrooted treesnestingstriadsAdams consensusAdams-2 consensusfull consensusmeasures of complexitynormalized consensus indexstrict consensustaxonomic tree

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Trees (05C05)

Related Items (12)

Closure systems, implicational systems, overhanging relations and the case of hierarchical classification ⋮ Preserving consensus hierarchies ⋮ Intersection rules for consensus \(n\)-trees ⋮ The structure of the overhanging relations associated with some types of closure systems ⋮ On finding the Adams consensus tree ⋮ DASACT: a decision aiding software for axiomatic consensus theory ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ Comparing and aggregating partially resolved trees ⋮ An explicit computation of the injective hull of certain finite metric spaces in terms of their associated Buneman complex ⋮ The asymmetric median tree. --- A new model for building consensus trees ⋮ Comparing and Aggregating Partially Resolved Trees ⋮ A supertree method for rooted trees

Cites Work

• The role of complexity in comparing classifications
• Faithful consensus methods for n-trees
• s-consensus trees and indices
• A formalization of consensus index methods
• Optimal algorithms for comparing trees with labeled leaves
• Consensus n-trees

This page was built for publication: N-trees as nestings: Complexity, similarity, and consensus