Additive Simila Rity Trees

Abstract

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… (More)

Topics

15 Figures and Tables

Cite this paper

@inproceedings{Sattath2000AdditiveSR, title={Additive Simila Rity Trees}, author={Shmuel Sattath}, year={2000} }