Peay presented a class of grouping methods based on the concept of the r-clique for symmetric data relationships. The concepts of the r-clique can be generalized readily to directed (or asymmetric) relationships, and groupings based on this generalization may be found conveniently using an adoption of Peay's methodology. (Author/BJG)

The connection between graph theory and clustering is reviewed and extended. Major emphasis is on restating, in a graph-theoretic context, selected past work in clustering, and conversely, developing alternative strategies from several standard concepts used in graph theory per se. (Author/RC)

Frender and Doubilet suggest that Bousfield's ratio of repetitions (RR) is the best measure of clustering in free recall presently available. Conditioning only on the number of words recalled, they determine the mean of RR in the absence of clustering. In this note the null variance of RR is presented. (Author)

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)

Points of view analysis, as a way to deal with individual differences in multidimensional scaling, was largely supplanted by the weighted Euclidean model. It is argued that the approach deserves new attention, especially as a technique to analyze group differences. A streamlined and integrated process is proposed. (SLD)

A class of closely related hierarchical grouping methods are discussed and a procedure which implements them in an integrated fashion is presented. These methods avoid some theoretical anomalies inherent in clustering and provide a framework for viewing partitioning and nonpartitioning grouping. Significant relationships between these methods and…