Euclidean consensus dendrograms and other classification structures
By embedding the ultrametric distances between objects in a classification structure into a Euclidean space, two linear-algebraic procedures can be used to obtain a consensus among any combination of dendrograms, partitions, coverings, or more general arrangements of overlapping groups; the consensus has the property that the sum of the squared distances from the objects in each of the separate representations to their positions in the consensus is minimized in the Euclidean space. A consensus classification structure (usually a dendrogram) is obtained by reversing the embedding procedure. Admissibility criteria for a consensus are briefly considered.
- scientific article; zbMATH DE number 3903773
- scientific article; zbMATH DE number 1140607
- Croisements, ordres et ultramètriques: Application à la recherche de consensus en classification automatique. II. (Crossings, orders and ultrametrics: Application to the investigation of consensus in automatic classification)
- Croisements, ordres et ultramétriques: Application à la recherche de consensus en classification automatique. (Crossings, orders and ultrametrics: Application of consensus research to automatic classification)
- The median procedure for n-trees
- Faithful consensus methods for n-trees
- Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects
- scientific article; zbMATH DE number 3473132 (Why is no real title available?)
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- Some distance properties of latent root and vector methods used in multivariate analysis
- Statistical Inference of Phylogenies
- The Length of a Generation
- Croisements, ordres et ultramétriques: Application à la recherche de consensus en classification automatique. (Crossings, orders and ultrametrics: Application of consensus research to automatic classification)
- Croisements, ordres et ultramètriques: Application à la recherche de consensus en classification automatique. II. (Crossings, orders and ultrametrics: Application to the investigation of consensus in automatic classification)
- Clustering from ordination
- Preserving consensus hierarchies
- Pseudocontinuity in hierarchical classifications
- Learning representations from dendrograms
- scientific article; zbMATH DE number 3852233 (Why is no real title available?)
- scientific article; zbMATH DE number 3903773 (Why is no real title available?)
- scientific article; zbMATH DE number 1140607 (Why is no real title available?)
- Morphological hierarchies: a unifying framework with new trees
This page was built for publication: Euclidean consensus dendrograms and other classification structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060515)