Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés

DOI10.1051/ro/1980140201571zbMath0434.90051OpenAlexW2586381419MaRDI QIDQ3873899

No author found.

Publication date: 1980

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104757

zbMATH Keywords

branch and bound algorithmdata classificationhierarchical classification algorithm

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Operations research and management science (90B99)

Related Items

Parsimonious trees, Deriving ultrametric tree structures from proximity data confounded by differential stimulus familiarity, A parametric procedure for ultrametric tree estimation from conditional rank order proximity data, Cluster analysis and mathematical programming, Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data, Fitting semiparametric clustering models to dissimilarity data, Combinatorial optimisation and hierarchical classifications, Espaliers: A generalization of dendrograms, A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance, Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm