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...

Full description

Saved in:
Bibliographic Details
Published in:Educational and psychological measurement 1980-10, Vol.40 (3), p.755-759
Main Authors: Milligan, Glenn W., Sokol, Lisa M.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0013-1644
1552-3888
DOI:10.1177/001316448004000320