Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data

Least squares algorithms for constructing constrained ultrametric and additive tree... A mathematical programming algorithm is developed for fitting ultrametric or additive trees to proximity data where external constraints are imposed on the topology of the tree. The two procedures minimize a least squares loss function. The method is illustrated on both synthetic and real data. A constrained ultrametric tree analysis was performed on similarities between 32 subjects based on preferences for ten odors, while a constrained additive tree analysis was carried out on some proximity data between kinship terms. Finally, some extensions of the methodology to other tree fitting procedures are mentioned. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Classification Springer Journals

Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data

Loading next page...
 
/lp/springer-journals/least-squares-algorithms-for-constructing-constrained-ultrametric-and-E03DfWTGWq

References (38)

Publisher
Springer Journals
Copyright
Copyright © 1987 by Springer-Verlag
Subject
Statistics; Statistical Theory and Methods; Pattern Recognition; Bioinformatics; Signal,Image and Speech Processing; Psychometrics; Marketing
ISSN
0176-4268
eISSN
1432-1343
DOI
10.1007/BF01896984
Publisher site
See Article on Publisher Site

Abstract

A mathematical programming algorithm is developed for fitting ultrametric or additive trees to proximity data where external constraints are imposed on the topology of the tree. The two procedures minimize a least squares loss function. The method is illustrated on both synthetic and real data. A constrained ultrametric tree analysis was performed on similarities between 32 subjects based on preferences for ten odors, while a constrained additive tree analysis was carried out on some proximity data between kinship terms. Finally, some extensions of the methodology to other tree fitting procedures are mentioned.

Journal

Journal of ClassificationSpringer Journals

Published: Jun 18, 2005

There are no references for this article.