Parsimonious trees (Q1088345): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Grouping for Maximum Homogeneity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4745160 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Statistical theory in clustering / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Consensus n-trees / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01890077 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3191882000 / rank | |||
Normal rank | |||
Latest revision as of 09:31, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parsimonious trees |
scientific article |
Statements
Parsimonious trees (English)
0 references
1987
0 references
Dendrograms based on n objects can contain as many as n-1 levels (internal nodes) and prove difficult to interpret. Two methods are described for transforming a dendrogram into a more readily interpretable parsimonious tree. These involve limiting either (i) the number of different values taken by the heights of the internal nodes, or (ii) the number of internal nodes. An illustrative example is presented.
0 references
hierarchical classification
0 references
algorithm
0 references
partitioning criteria
0 references
clustering
0 references
dendrogram
0 references
parsimonious tree
0 references
internal nodes
0 references
0 references
