The relation between hierarchical and Euclidean models for psychological distances
From MaRDI portal
Publication:2264633
DOI10.1007/BF02291218zbMATH Open0273.92007OpenAlexW2038848017MaRDI QIDQ2264633FDOQ2264633
Authors: Eric W. Holman
Publication date: 1972
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02291218
Cites Work
Cited In (7)
- Hierarchical trees can be perfectly scaled in one dimension
- Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm
- On certain linear mappings between inner-product and squared-distance matrices
- A parametric procedure for ultrametric tree estimation from conditional rank order proximity data
- Application of cut polyhedra. I
- Completely nonmetric multidimensional scaling
- On Euclidean images of a set endowed with a preordonnance
This page was built for publication: The relation between hierarchical and Euclidean models for psychological distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264633)