Metrics on spaces of finite trees

DOI10.1016/0022-2496(73)90003-5zbMATH Open0271.92011OpenAlexW1966791050MaRDI QIDQ758937FDOQ758937

Authors: 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) Mathematical psychology (91E99) Combinatorial aspects of finite geometries (05B25)

Cites Work

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

Cited In (30)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758937)