Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

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
Published by: Wiley for the Royal Statistical Society
DOI: 10.2307/2346439
Stable URL: http://www.jstor.org/stable/2346439
Page Count: 11
  • Read Online (Free)
  • Download ($29.00)
  • Subscribe ($19.50)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Minimum Spanning Trees and Single Linkage Cluster Analysis
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
54
    54
  • Thumbnail: Page 
55
    55
  • Thumbnail: Page 
56
    56
  • Thumbnail: Page 
57
    57
  • Thumbnail: Page 
58
    58
  • Thumbnail: Page 
59
    59
  • Thumbnail: Page 
60
    60
  • Thumbnail: Page 
61
    61
  • Thumbnail: Page 
62
    62
  • Thumbnail: Page 
63
    63
  • Thumbnail: Page 
64
    64