A strategy for reordering the hierarchical tree structure is presented. While the order of terminal nodes of Johnson's procedure is arbitrary, this procedure will rearrange every triad of nodes under a common least upper node so that the middle node is nonarbitrarily closest to the anchored node. (Author/CTM)

Discussion of a method of classification which attempts to use the particular set of indices of association which produce the most reliable and valid solution. (PR)

A relatively reliable and valid hierarchy of clusters of objects is plotted from the highest column entries, exclusively, of a matrix of interassociations between the objects. Having developed out of a loose definition of types, the method isolates both loose and highly definitive types, and all those in between. (Author/RC)