On lattice consensus methods

DOI10.1007/BF01894189zbMath0617.62068MaRDI QIDQ1822176

Dean A. Neumann, Victor T. jun. Norton

Publication date: 1986

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

zbMATH Keywords

partitionsconsensus problemclassificationsPareto axiombetweenness axiomn-treesdendrogramsLattice polynomials

Mathematics Subject Classification ID

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

Related Items

Preserving consensus hierarchies ⋮ On a dependence relation in finite lattices ⋮ Ensemble clustering in the belief functions framework ⋮ Arrowian characterizations of latticial federation consensus functions

Cites Work

• Metrics on spaces of finite trees
• Faithful consensus methods for n-trees
• s-consensus trees and indices
• Consensus n-trees
• The median procedure in cluster analysis and social choice theory
• Unnamed Item
• Unnamed Item

This page was built for publication: On lattice consensus methods