Chapter Contents
Chapter Contents
Previous
Previous
Next
Next
The CLUSTER Procedure

Algorithms

Anderberg (1973) describes three algorithms for implementing agglomerative hierarchical clustering: stored data, stored distance, and sorted distance. The algorithms used by PROC CLUSTER for each method are indicated in Table 23.2. For METHOD=AVERAGE, METHOD=CENTROID, or METHOD=WARD, either the stored data or the stored distance algorithm can be used. For these methods, if the data are distances or if you specify the NOSQUARE option, the stored distance algorithm is used; otherwise, the stored data algorithm is used.

Table 23.2: Three Algorithms for Implementing Agglomerative Hierarchical Clustering
  Algorithm
Stored Stored Stored Sorted
Method Data Distance Distance
AVERAGExx 
CENTROIDxx 
COMPLETE x 
DENSITY  x
EMLx  
FLEXIBLE x 
MCQUITTY x 
MEDIAN x 
SINGLE x 
TWOSTAGE  x
WARDxx 

Chapter Contents
Chapter Contents
Previous
Previous
Next
Next
Top
Top

Copyright © 1999 by SAS Institute Inc., Cary, NC, USA. All rights reserved.