Hierarchical trees can be perfectly scaled in one dimension

DOI10.1007/BF01901668MaRDI QIDQ757293zbMATH OpenOpenAlexFDO

Authors 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

treemonotone regressionhierarchical clusteringultrametricnon-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)

Recommendations

• scientific article; zbMATH DE number 4058669
• Eigenanalysis and metric multidimensional scaling on hierarchical structures
• scientific article; zbMATH DE number 1140600
• scientific article; zbMATH DE number 1131221
• Linear and circular unidimensional scaling for symmetric proximity matrices

Cites work

• scientific article; zbMATH DE number 4058669 (Why is no real title available?)
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Representation of structure in similarity data: problems and prospects
• The relation between hierarchical and Euclidean models for psychological distances

Cited in

(5)

• The remarkable simplicity of very high dimensional data: application of model-based clustering
• Symmetry in data mining and analysis: a unifying view based on hierarchy
• scientific article; zbMATH DE number 4058669 (Why is no real title available?)
• Thinking ultrametrically, thinking p-adically
• Direct reading algorithm for hierarchical clustering

This page was built for publication: Hierarchical trees can be perfectly scaled in one dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757293)