Tree Representations of Rectangular Proximity Matrices

Geert De Soete, Wayne S. DeSarbo, George Y. Furnas, J. Pouglas Carroll

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

A least-squares algorithm for fitting ultrametric and nath 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.

Original languageEnglish (US)
Pages (from-to)377-392
Number of pages16
JournalAdvances in Psychology
Volume20
Issue numberC
DOIs
StatePublished - 1984

All Science Journal Classification (ASJC) codes

  • Psychology(all)

Fingerprint

Dive into the research topics of 'Tree Representations of Rectangular Proximity Matrices'. Together they form a unique fingerprint.

Cite this