论文信息 - A Two-Stage Clustering Algorithm with Robust Recovery Characteristics

A Two-Stage Clustering Algorithm with Robust Recovery Characteristics

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.

G. W. Milligan | Glenn W. Milligan | Lisa M. Sokol | G. Milligan | L. M. Sokol

[1] G. W. Milligan,et al. The validation of four ultrametric clustering algorithms , 1980, Pattern Recognit..

[2] E. Edgington. Approximate Randomization Tests , 1969 .

[3] Michael R. Anderberg,et al. Cluster Analysis for Applications , 1973 .

[4] Leslie C. Morey,et al. A Comparison of Four Clustering Methods Using MMPI Monte Carlo Data , 1980 .

[5] R. M. Cormack,et al. A Review of Classification , 1971 .

[6] Roger K. Blashfield,et al. Mixture model tests of cluster analysis: Accuracy of four agglomerative hierarchical methods. , 1976 .

[7] C. Edelbrock. Mixture Model Tests Of Hierarchical Clustering Algorithms: The Problem Of Classifying Everybody. , 1979, Multivariate behavioral research.

[8] G. W. Milligan,et al. An examination of the effect of six types of error perturbation on fifteen clustering algorithms , 1980 .