论文信息 - REPRESENTATION OF SIMILARITY MATRICES BY TREES

REPRESENTATION OF SIMILARITY MATRICES BY TREES

Abstract Suppose given a set of similarities (or dissimilarities) between pairs of of objects from some set of objects, such as animal species, books, colours. We wish to construct from this similarity matrix a tree, or nested set of clusterings of the objects; graphs of trees provide a striking visual display of similarity groupings of the objects. The construction requires (1) a definition specifying when a similarity matrix has exact tree structure, (2) a measure of distance between any two similarity matrices, which yields (when combined with (1)) a measure of distance between any similarity matrix and any tree, (3) a family of local operations on a tree, which can be used to search out trees which best fit a given similarity matrix. The construction technique is applied to voting behaviour of the 50 United States in the last 13 presidential elections, giving a tree clustering of the states.

J. Hartigan

[1] D. Cox. Note on Grouping , 1957 .

[2] Walter D. Fisher. On Grouping for Maximum Homogeneity , 1958 .

[3] Robert R. Sokal,et al. A statistical method for evaluating systematic relationships , 1958 .

[4] O. Ore. Theory of Graphs , 1962 .

[5] W. A. Thompson. The Problem of Negative Estimates of Variance Components , 1962 .

[6] R. Sokal,et al. THE COMPARISON OF DENDROGRAMS BY OBJECTIVE METHODS , 1962 .

[7] R. Shepard. The analysis of proximities: Multidimensional scaling with an unknown distance function. II , 1962 .

[8] R. Sokal,et al. Principles of numerical taxonomy , 1965 .

[9] E. M. L. Beale,et al. Nonlinear and Dynamic Programming , 1965 .

[10] J. Kruskal. Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis , 1964 .

[11] Geoffrey H. Ball,et al. Data analysis in the social sciences: what about the details? , 1965, AFIPS '65 (Fall, part I).

[12] A W EDWARDS,et al. A METHOD FOR CLUSTER ANALYSIS. , 1965, Biometrics.