Presents an exposition of two data reduction methods--single-link and complete-link hierarchical clustering. Emphasis is on statistical techniques for evaluating the adequacy of a completed partition hierarchy and the individual partitions within the sequence. A numerical reanalysis of data illustrates the methodology. (RC)

An empirical assesssment of the space distortion properties of two prototypic hierarchical clustering procedures is given in terms of an occupancy model developed from combinatorics. Using one simple example, the single-link and complete-link clustering strategies now in common use in the behavioral sciences are empirically shown to be space…

The present paper discusses two rather different types of partitioning techniques that still have the same property of monotone invariance. (Author)

Paper is an attempt to extend the hierarchical partitioning algorithms and to emphasize a general connection between these clustering procedures and the mathematical theory of lattices. (Author)