Euclidean consensus dendrograms and other classification structures (Q1060515): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0025-5564(85)90021-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992494212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Inference of Phylogenies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some distance properties of latent root and vector methods used in multivariate analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Length of a Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faithful consensus methods for n-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085109 / rank
 
Normal rank

Latest revision as of 18:14, 14 June 2024

scientific article
Language Label Description Also known as
English
Euclidean consensus dendrograms and other classification structures
scientific article

    Statements

    Euclidean consensus dendrograms and other classification structures (English)
    0 references
    0 references
    1985
    0 references
    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.
    0 references
    0 references
    ultrametric distances
    0 references
    Euclidean space
    0 references
    linear-algebraic procedures
    0 references
    combination of dendrograms
    0 references
    partitions
    0 references
    coverings
    0 references
    consensus classification structure
    0 references
    embedding procedure
    0 references
    Admissibility criteria
    0 references
    0 references