The estimation of ultrametric and path length trees from rectangular proximity data |
| |
Authors: | Geert De Soete Wayne S DeSarbo George W Furnas J Douglas Carroll |
| |
Institution: | (1) Department of Psychology, University of Ghent, Henri Dunantlaan 2, B-9000 Ghent, Belgium;(2) AT&T Bell Laboratories, Room 2C-256, 600 Mountain Avenue, 07974 Murray Hill, N.J.;(3) Bell Communications Research, USA |
| |
Abstract: | 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. The algorithm is evaluated via two Monte Carlo studies. Examples of fitting ultrametric and path length trees are presented.G. De Soete is Aspirant of the Belgian Nationaal Fonds voor Wetenschappelijk Onderzoek at the University of Ghent, Belgium. W. S. DeSarbo and J. D. Carroll are Members of Technical Staff at AT&T Bell Laboratories, Murray Hill, N.J. G. W. Furnas is Member of Technical Staff at Bell Communications Research, Murray Hill, N.J. |
| |
Keywords: | Cluster Analysis Trees |
本文献已被 SpringerLink 等数据库收录! |
|