Two FORTRAN IV computer programs for a two-stage clustering algorithm with robust recovery characteristics are described. In Stage 1, a group average hierarchical algorithm generates cluster centroids which are used as starting seed points for Stage 2, Jancey's k-means nonhierarchical algorithm. Also available with the hierarchical algorithm is a hypothesis test procedure which can be used to determine whether significant cluster structure exists in the data.
Get full access to this article
View all access options for this article.
References
1.
Anderberg, M. R.Cluster analysis for applications . New York: Academic Press , 1973.
2.
Blashfield, R. K.Mixture model test of cluster analysis: Accuracy of four agglomerative hierarchical methods. Psychological Bulletin, 1976, 83 , 377-388.
3.
Blashfield, R. K. and Morey, L. C.A comparison of four clustering methods using MMPI Monte Carlo data. Applied Psychological Measurement, 1980, in press.
4.
Cormack, R. M.A review of classification . Journal of the Royal Statistical Society (Series A), 1971, 134, 321-367.
5.
Edelbrock, C.Comparing the accuracy of hierarchical clustering algorithms : The problem of classifying everybody. Multivariate Behavioral Research, 1979, 14 , 367-384.
6.
Edgington, E. S.Approximate randomization tests. Journal of Psychology, 1969, 22, 143-149 .
7.
Milligan, G. W.An examination of the effect of six types of error perturbation on fifteen clustering algorithms. Psychometrika, 1980, 45 , in press.
8.
Milligan, G. W. and Isaac, P. D.The validation of four ultrametric clustering algorithms . Pattern Recognition, 1980, 12, 41-50 .
