A least-squares strategy is proposed for representing a two-mode proximity matrix as an approximate sum of a small number of matrices that satisfy certain simple order constraints on their entries. The primary class of constraints considered defines Q-forms for particular conditions in a two-mode matrix. (SLD)

Introduces a method for fitting order-constrained matrices that satisfy the strongly anti-Robinson restrictions (SAR). The method permits a representation of the fitted values in a (least-squares) SAR approximating matrix as lengths of paths in a graph. The approach is illustrated with a published proximity matrix. (SLD)

A method is proposed for comparison of distinct partitions of the same set of n objects through a simple cross-product index defined between corresponding entries from two proximity matrices providing particular a priori codings of the within-class and between-class relationships for the partitions. (SLD)

Illustrates a simple nonparametric alternative that can be used to test a hypothesis that two proximity matrices on the same set of variables or objects reflect a similar pattern of high and low entries. (RC)

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…