The role of complexity in comparing classifications

DOI10.1016/0025-5564(83)90080-9zbMath0525.62058MaRDI QIDQ585631

William H. E. Day

Publication date: 1983

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(83)90080-9

zbMATH Keywords

complexity; comparing classifications; measure of consensus; numerical taxonomy

Mathematics Subject Classification ID

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

62P10: Applications of statistics to biology and medical sciences; meta analysis

92B05: General biology and biomathematics

68R99: Discrete mathematics in relation to computer science

06B99: Lattices

Related Items

A formalization of consensus index methods, Optimal algorithms for comparing trees with labeled leaves, A model in partial orders for comparing objects by dualistic measures, Comparison of classifications using measures intermediate between metric dissimilarity and consensus similarity, On the use of ordered sets in problems of comparison and consensus of classifications, N-trees as nestings: Complexity, similarity, and consensus, Arrowian characterizations of latticial federation consensus functions, s-consensus index method: An additional axiom

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics on spaces of finite trees
• Faithful consensus methods for n-trees
• Consensus n-trees
• Metrics on partially ordered sets - a survey
• When is one estimate of evolutionary relationships a refinement of another?
• The median procedure in cluster analysis and social choice theory
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
• The complexity of computing metric distances between partitions
• Parallel concepts in graph theory
• Consensus functions defined on trees
• Multidimensional scaling of measures of distance between partitions