Hierarchical trees can be perfectly scaled in one dimension

DOI10.1007/BF01901668zbMath0722.92022OpenAlexW1992121177MaRDI QIDQ757293

Frank Critchley, Willem J. Heiser

Publication date: 1988

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

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

zbMATH Keywords

treehierarchical clusteringultrametricmonotone regressionnon-metric Euclidean multidimensional scalingone-dimensional scalingpolyhedral convex cone of solutionsprimary approach to ties

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) One- and multidimensional scaling in the social and behavioral sciences (91C15)

Related Items

Direct reading algorithm for hierarchical clustering ⋮ Symmetry in data mining and analysis: a unifying view based on hierarchy ⋮ Thinking Ultrametrically, Thinking p-Adically ⋮ The remarkable simplicity of very high dimensional data: application of model-based clustering

Cites Work

• Unnamed Item
• Representation of structure in similarity data: problems and prospects
• The relation between hierarchical and Euclidean models for psychological distances
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis