Tree structures for proximity data

Previous work on representing proximity data by tree structures is reviewed. The authors then present two paradigms for data collection and develop appropriate measurement structures for non‐numerical data. Two theorems on representing these data by rooted or unrooted trees are given and their relationship to the more conventional representation by a dissimilarity index is discussed.