Additive Similarity Trees
Shmuel Sattath, Amos Tversky · Psychometrika · 1977
Similarity data can be represented by additive trees. In this model, objects are represented by the external nodes of a tree, and the dissimilarity between objects is the length of the path joining them. The additive tree is less restrictive than the ultrametric tree, commonly known as the hierarchical clustering scheme. The two representations are characterized and compared. A computer program, ADDTREE, for the construction of additive trees is described and applied to several sets of data. A comparison of these results to the results of multidimensional scaling illustrates some empirical and theoretical advantages of tree representations over spatial representations of proximity data.
Cited by 591 works. doi:10.1007/bf02293654
Authors
References
- Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis
- Hierarchical Clustering Schemes
- Features of similarity.
- Numerical Taxonomy: The Principles and Practice of Numerical Classification
- A General Nonmetric Technique for Finding the Smallest Coordinate Space for a Configuration of Points
- Representation of Structure in Similarity Data: Problems and Prospects
- Unrooted trees for numerical taxonomy
- Distance matrix of a graph and its realizability
- Spatial, Non-Spatial and Hybrid Models for Scaling
- The Recovery of Trees from Measures of Dissimilarity