Cites work
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3204689 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3228308 (Why is no real title available?)
- scientific article; zbMATH DE number 3248699 (Why is no real title available?)
- scientific article; zbMATH DE number 3248704 (Why is no real title available?)
- scientific article; zbMATH DE number 3314342 (Why is no real title available?)
- scientific article; zbMATH DE number 3397368 (Why is no real title available?)
- scientific article; zbMATH DE number 3190627 (Why is no real title available?)
- scientific article; zbMATH DE number 3049708 (Why is no real title available?)
- A metric and an ordering on sets
- Autometrized unary algebras
- Distance matrix of a graph and its realizability
- Hierarchical clustering schemes
- Measures of Association for Cross Classifications
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Multidimensional scaling of measures of distance between partitions
- Statistical methods for a theory of cue learning
- Statistical theory in clustering
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
Cited in
(30)- Was Euclid an unnecessarily sophisticated psychologist?
- Axioms for consensus functions based on lower bounds in posets
- The pruning-grafting lattice of binary trees
- Biorder families, valued relations, and preference modelling
- On lattice consensus methods
- The role of complexity in comparing classifications
- The complexity of computing metric distances between partitions
- A model in partial orders for comparing objects by dualistic measures
- Metrics on partially ordered sets - a survey
- On a matching distance between rooted phylogenetic trees
- Multidimensional scaling of measures of distance between partitions
- Some applications of graph theory to clustering
- Approximating minimum-length-sequence metrics: A cautionary note
- Motzkin subposets and Motzkin geodesics in Tamari lattices.
- A computationally efficient approximation to the nearest neighbor interchange metric
- Universality of approximate message passing algorithms and tensor networks
- Metric inference for social networks
- Properties of Levenshtein metrics on sequences
- Constructing blockmodels: how and why
- A limited possibility result for social choice under majority voting
- Lattice-based similarity measures between ordered trees
- Fuzzy trees in decision support systems
- The median procedure in cluster analysis and social choice theory
- Transfer distance between partitions
- A distance metric on binary trees using lattice-theoretic measures
- Probabilistic models in cluster analysis
- Statistical properties of the single linkage hierarchical clustering estimator
- Clustering and isolation in the consensus problem for partitions
- 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
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)
