Pages that link to "Item:Q1113590"

The following pages link to Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data (Q1113590):

Displaying 18 items.

• Reconstructing the shape of a tree from observed dissimilarity data (Q103560) (← links)
• In memoriam: J. Douglas Carroll, 1939--2011 (Q263352) (← links)
• Clique optimization: A method to construct parsimonious ultrametric trees from similarity data (Q923556) (← links)
• The representation of three-way proximity data by single and multiple tree structure models (Q1059960) (← links)
• Was Euclid an unnecessarily sophisticated psychologist? (Q1205750) (← links)
• Probabilistic models in cluster analysis (Q1350792) (← links)
• A survey of constrained classification (Q1351841) (← links)
• Exploring the set-theoretical structure of objects by additive trees (Q1362284) (← links)
• Constructing ultrametric and additive trees based on the \(L_1\) norm. (Q1566102) (← links)
• An algorithm to obtain additive trees based upon the preservation of the clusters structure (Q1874090) (← links)
• Deriving ultrametric tree structures from proximity data confounded by differential stimulus familiarity (Q1901365) (← links)
• A parametric procedure for ultrametric tree estimation from conditional rank order proximity data (Q1901372) (← links)
• An efficient algorithm for supertrees (Q1901397) (← links)
• In memoriam, J. Douglas Carroll 1939--2011 (Q1940978) (← links)
• Order preserving hierarchical agglomerative clustering (Q2163229) (← links)
• A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance (Q2563540) (← links)
• Iterative projection strategies for the least‐squares fitting of tree structures to proximity data (Q4715685) (← links)
• (Q5265414) (← links)