On an independence condition for consensus \(n\)-trees

DOI10.1016/0893-9659(89)90121-3zbMath0709.90008OpenAlexW2030540566MaRDI QIDQ922253

Jean-Pierre Barthelemy, Fred R. McMorris

Publication date: 1989

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(89)90121-3

zbMATH Keywords

hierarchical classificationconsensus treeindependence conditionaggregation of several tree-structured data

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Trees (05C05) Social choice (91B14) One- and multidimensional scaling in the social and behavioral sciences (91C15)

Related Items (5)

Dictatorial consensus functions on \(n\)-trees ⋮ Stability conditions for consensus functions defined on \(n\)-trees ⋮ Arrow's Theorem for closed weak hierarchies ⋮ Independence conditions for consensus \(n\)-trees revisited ⋮ Wilson's theorem for consensus functions on hierarchies

Cites Work

• Unnamed Item
• Faithful consensus methods for n-trees
• Axioms for consensus functions on undirected phylogenetic trees
• A formalization of consensus index methods
• On the use of ordered sets in problems of comparison and consensus of classifications
• Consensus n-trees
• Arrow's theorem: Unusual domains and extended codomains
• Arrowian characterizations of latticial federation consensus functions
• The median procedure for n-trees
• Consensus functions defined on trees
• Tree structures for proximity data

This page was built for publication: On an independence condition for consensus \(n\)-trees