A parametric procedure for ultrametric tree estimation from conditional rank order proximity data
DOI10.1007/BF02294429zbMATH Open0833.62101MaRDI QIDQ1901372FDOQ1901372
Authors: Martin R. Young, Wayne S. DeSarbo 
Publication date: 20 March 1996
Published in: Psychometrika (Search for Journal in Brave)
Recommendations
- Mixtures of (constrained) ultrametric trees
- Deriving ultrametric tree structures from proximity data confounded by differential stimulus familiarity
- Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
- Constructing ultrametric and additive trees based on the \(L_1\) norm.
- scientific article; zbMATH DE number 1131221
maximum likelihoodmaximum likelihood estimationMonte Carlohierarchical clusteringconsumer psychologyconditional rank order proximity dataestimating ultrametric trees
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to psychology (62P15)
Cites Work
- Estimating the dimension of a model
- Title not available (Why is that?)
- Probability models on rankings
- Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
- Title not available (Why is that?)
- Multistage Ranking Models
- Maximum likelihood estimation in multidimensional scaling
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Some Statistical Approaches to Multidimensional Scaling Data
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Free trees and bidirectional trees as representations of psychological distance
- Nonmetric multidimensional scaling. A numerical method
- Multidimensional scaling. I: Theory and method
- Unrooted trees for numerical taxonomy
- Model selection and Akaike's information criterion (AIC): The general theory and its analytical extensions
- Restart procedures for the conjugate gradient method
- Hierarchical clustering schemes
- Multidimensional scaling, tree-fitting, and clustering
- The representation of three-way proximity data by single and multiple tree structure models
- Specifying and testing econometric models for rank-ordered data
- Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
- Spatial versus tree representations of proximity data
- Spatial, non-spatial and hybrid models for scaling
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Marginal likelihoods based on Cox's regression and life model
- Title not available (Why is that?)
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- A general nonmetric technique for finding the smallest coordinate space for a configuration of points
- Construction de l'ultramétrique la plus proche d'une dissimilarité au sens des moindres carrés
- The structure and construction of taxonomic hierarchies
- Validity studies in clustering methodologies
- The relation between hierarchical and Euclidean models for psychological distances
- Extended similarity trees
- Maximum Likelihood Regression of Rank-Censored Data
- A new stochastic ultrametric tree unfolding methodology for assessing competitive market structure and deriving market segments
Cited In (3)
Uses Software
This page was built for publication: A parametric procedure for ultrametric tree estimation from conditional rank order proximity data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901372)
