Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
From MaRDI portal
Publication:1113590
DOI10.1007/BF01896984zbMath0662.62065OpenAlexW2005551015MaRDI QIDQ1113590
Geert de Soete, J. Douglas Carroll, Wayne S. Desarbo
Publication date: 1987
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01896984
hierarchical clusteringmathematical programmingproximity dataexternal constraintsadditive treesconstrained classification methodsconstrained ultrametric tree analysisleast squares loss functionpath length trees
Related Items (10)
Probabilistic models in cluster analysis ⋮ A survey of constrained classification ⋮ A parametric procedure for ultrametric tree estimation from conditional rank order proximity data ⋮ An efficient algorithm for supertrees ⋮ Order preserving hierarchical agglomerative clustering ⋮ In memoriam, J. Douglas Carroll 1939--2011 ⋮ Clique optimization: A method to construct parsimonious ultrametric trees from similarity data ⋮ Was Euclid an unnecessarily sophisticated psychologist? ⋮ A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance ⋮ In memoriam: J. Douglas Carroll, 1939--2011
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained classification: The use of a priori information in cluster analysis
- Some types of clustering with relational constraints
- The representation of three-way proximity data by single and multiple tree structure models
- Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm
- Conditional Clustering
- Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés
- Restart procedures for the conjugate gradient method
This page was built for publication: Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
