Tree Representations of Rectangular Proximity Matrices
Trends in Mathematical Psychology, R. Burggenhaut and V. Degreef (eds.), New York: North Holland, pp. 377-392
16 Pages Posted: 13 Jul 2017
Date Written: 1984
A least-squares algorithm for fitting ultrametric and path length or additive trees to two-way, two-mode proximity data is presented. The algorithm utilizes a penalty function to enforce the ultrametric inequality generalized for asymmetric, and generally rectangular (rather than square) proximity matrices in estimating an ultrametric tree. This stage is used in an alternating least-squares fashion with closed-form formulas for estimating path length constants for deriving path length trees.
Suggested Citation: Suggested Citation