You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Minimum Spanning Trees and Single Linkage Cluster Analysis
J. C. Gower and G. J. S. Ross
Journal of the Royal Statistical Society. Series C (Applied Statistics)
Vol. 18, No. 1 (1969), pp. 54-64
Stable URL: http://www.jstor.org/stable/2346439
Page Count: 11
You can always find the topics here!Topics: Cluster analysis, Algorithms, Mathematical problems, Vertices, Applied statistics, Similarity theorem, Statistics, Bar codes, Printing, Code switching
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Minimum spanning trees (MST) and single linkage cluster analysis (SLCA) are explained and it is shown that all the information required for the SLCA of a set of points is contained in their MST. Known algorithms for finding the MST are discussed. They are efficient even when there are very many points; this makes a SLCA practicable when other methods of cluster analysis are not. The relevant computing procedures are published in the Algorithm section of the same issue of Applied Statistics. The use of the MST in the interpretation of vector diagrams arising in multivariate analysis is illustrated by an example.
Journal of the Royal Statistical Society. Series C (Applied Statistics) © 1969 Royal Statistical Society