Parsimonious trees

DOI10.1007/BF01890077zbMath0612.62090OpenAlexW3191882000MaRDI QIDQ1088345

B. George

Publication date: 1987

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01890077

zbMATH Keywords

algorithmclusteringhierarchical classificationdendrogrampartitioning criteriainternal nodesparsimonious tree

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (5)

A survey of constrained classification ⋮ Clique optimization: A method to construct parsimonious ultrametric trees from similarity data ⋮ Fitting semiparametric clustering models to dissimilarity data ⋮ Identifying genuine clusters in a classification ⋮ A constrained \(k\)-means clustering algorithm for classifying spatial units

Cites Work

• Unnamed Item
• Statistical theory in clustering
• Consensus n-trees
• On Grouping for Maximum Homogeneity
• Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés

This page was built for publication: Parsimonious trees