Chapter Contents |
Previous |
Next |
The CLUSTER Procedure |
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 ClusteringAlgorithm | |||
Stored | Stored | Stored | Sorted |
Method | Data | Distance | Distance |
AVERAGE | x | x | |
CENTROID | x | x | |
COMPLETE | x | ||
DENSITY | x | ||
EML | x | ||
FLEXIBLE | x | ||
MCQUITTY | x | ||
MEDIAN | x | ||
SINGLE | x | ||
TWOSTAGE | x | ||
WARD | x | x |
Chapter Contents |
Previous |
Next |
Top |
Copyright © 1999 by SAS Institute Inc., Cary, NC, USA. All rights reserved.