Iterative projection strategies for the least‐squares fitting of tree structures to proximity data

DOI10.1111/j.2044-8317.1995.tb01065.xzbMath0858.62002OpenAlexW1987263656MaRDI QIDQ4715685

Phipps Arabie, Lawrence J. Hubert

Publication date: 23 March 1997

Published in: British Journal of Mathematical and Statistical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.2044-8317.1995.tb01065.x

zbMATH Keywords

penalty functionsconstraintsleast squares optimizationultrametricsdata representationiterative projectionadditive treesgraph-theoretic structuressymmetry proximity values

Mathematics Subject Classification ID

Related Items (8)

Cluster analysis and mathematical programming ⋮ Two-mode clustering methods: astructuredoverview ⋮ A tutorial on the balanced minimum evolution problem ⋮ Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices ⋮ The minimum evolution problem: Overview and classification ⋮ Limited information estimation and testing of Thurstonian models for paired comparison data under multiple judgment sampling

This page was built for publication: Iterative projection strategies for the least‐squares fitting of tree structures to proximity data