Metrics on spaces of finite trees

DOI10.1016/0022-2496(73)90003-5zbMath0271.92011OpenAlexW1966791050MaRDI QIDQ758937

Scott A. Boorman, Donald C. Olivier

Publication date: 1973

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-2496(73)90003-5

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of finite geometries (05B25) Mathematical psychology (91E99)

Related Items (29)

Axioms for consensus functions based on lower bounds in posets ⋮ Biorder families, valued relations, and preference modelling ⋮ Comparison of classifications using measures intermediate between metric dissimilarity and consensus similarity ⋮ Metric inference for social networks ⋮ The pruning-grafting lattice of binary trees ⋮ Probabilistic models in cluster analysis ⋮ On the use of ordered sets in problems of comparison and consensus of classifications ⋮ Fuzzy trees in decision support systems ⋮ Metrics on partially ordered sets - a survey ⋮ A distance metric on binary trees using lattice-theoretic measures ⋮ Transfer distance between partitions ⋮ The median procedure in cluster analysis and social choice theory ⋮ The complexity of computing metric distances between partitions ⋮ On a matching distance between rooted phylogenetic trees ⋮ Statistical properties of the single linkage hierarchical clustering estimator ⋮ Was Euclid an unnecessarily sophisticated psychologist? ⋮ Some applications of graph theory to clustering ⋮ Clustering and isolation in the consensus problem for partitions ⋮ The role of complexity in comparing classifications ⋮ Constructing blockmodels: how and why ⋮ On lattice consensus methods ⋮ Multidimensional scaling of measures of distance between partitions ⋮ A limited possibility result for social choice under majority voting ⋮ Lattice-based similarity measures between ordered trees ⋮ Approximating minimum-length-sequence metrics: A cautionary note ⋮ Properties of Levenshtein metrics on sequences ⋮ A computationally efficient approximation to the nearest neighbor interchange metric ⋮ Motzkin subposets and Motzkin geodesics in Tamari lattices. ⋮ A model in partial orders for comparing objects by dualistic measures

Cites Work

• A metric and an ordering on sets
• Statistical theory in clustering
• Hierarchical clustering schemes
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
• Statistical methods for a theory of cue learning
• Multidimensional scaling of measures of distance between partitions
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Distance matrix of a graph and its realizability
• Autometrized unary algebras
• Measures of Association for Cross Classifications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Metrics on spaces of finite trees